Aklan Catholic College

Archbishop Gabriel M. Reyes St.

5600 Kalibo, Aklan, Philippines
Tel. Nos.: (036)268-4152; 268-9171
Fax No.: (036)268-4010
Website: http://www.acc.edu.ph
E-mail Add: [email protected]

LINEAR PROGRAMMING MAXIMIZATION PROBLEM

The term “programming” refers to the use of certain mathematical techniques to obtain the best
possible solution to a problem involving limited resources. These resources involve manpower,
natural resources, raw materials, funds and the like.

Linear programming is a scientific method of solving problems which seek to achieve the best
possible solution under certain restraining conditions.

Linear programming involves the use of mathematical models to provide optimum solution to
certain types of problems with the following characteristics:

1. The objective function which expresses the objective of the problem. Every business
firm’s major objective is to maximize profit and to minimize cost.
2. The constraints or limitations of resources such as the availability of raw materials,
processing time, market limitations and other restrictions.
3. The objective function and constraints can be expressed as mathematical equations and/or
inequalities which must be linear in nature.
4. There should be an alternative course of action, one of which will achieve the objective.

MAXIMIZATION PROBLEM: GRAPHICAL METHOD

This method makes use of graphs to arrive at the optimum solution. The word optimum means
maximum (as large as possible) or minimum (as small as possible). The following is a brief
summary of the graphical method approach to linear programming:

1. Identify the unknowns in the problem and represent them by using decision variables.
The decision variables may be represented by x and y or other letter(s) convenient to use.
2. State the objective function to be optimized (profit or cost) in the equation.
3. Formulate constrains. Express them as linear equations or inequalities.
4. Graph the linear constraints to form a convex polygon and find the points which define
the feasible region. The feasible region is the area of feasible solution.
5. Determine the optimal solution. The optimal solution can be found in at least one of the
corners or vertex of the convex polygon formed.

Illustration:
Dela Cruz Furniture Shop located in Kalibo, Aklan makes two kinds of products, cabinets and
dressers, which pass through the Assembly and the Finishing departments. The Assembly
department has 60 hours of work available each week, while the Finishing department has 48
hours each week. Making one cabinet needs 2 hours in Finishing and 4 hours in Assembly, while
it takes 2 hours to assemble a dresser and 4 hours to finish it. It the profit generated per cabinet is
P100 and per dresser is P80, how many units of cabinets and dressers should be produced in
order to obtain the maximum profit?

Solution:

Cabinets Dressers Time

(X1) (X2) Available
Time in Assembly 4 hrs 2 hrs 60 hrs
Time in Finishing 2 hrs 4 hrs 48 hrs
Profit P100/u P80/u

1
 I. Decision Variables:

Let X1 = no. of cabinets to be produced and sold to maximize profit.

Let X2 = no. of dressers to be produced and sold to maximize profit.

II. Objective Function:

Max P = 100X1 + 80X2

III. Subject to:

Explicit constraints

4x1 + 2x2 ≤ 60 Assembly

2x1 + 4x2 ≤ 48 Finishing

Implicit constraints:

x1 ≥ 0 ; x2 ; x2 ≥ 0

IV. Graph only the explicit constraints. Change the inequalities to equalities in order to be
able to graph the constraints.

4x1 + 2x2 ≤ 60 2x1 + 4x2 ≤ 48

4x1 + 2x2 = 60 2x1 + 4x2 = 48

The hatched region is the feasible region where the optimal solution can be found. It is
the region or area of the convex polygon formed and is bound by the two (graphs) lines
from the point of origin.

2
 The next step is to determine the optimal solution by testing four corners or vertex of the
shaded area denoted by P0, P1, P3, P4. Substitute the coordinates of these points into the
objective function. The point that yields the highest profit is the optimal solution.

P0 (0,0): max P = 100x1 + 80x2

= 100(0) + 80(0)
=0

P1 (0,12): max P = 100x1 + 80x2

= 100(0) + 80(12)
= P960

P3 (12,6): max P = 100x1 + 80x2

= 100(12) + 80(6)
= P1,680

P4 (15,0): max P = 100x1 + 80x2

= 100(15) + 80(0)
= P1,500

V. Decision: In order to maximize weekly profits to P1,680, Dela Cruz Furniture Shop
should manufacture and sell 12 units of cabinets and 6 units of dressers.

Another Illustration:
Hazel’s Garment Inc. produces two styles of Jeans, Style A and Style B (among their other
products). Raw materials available for these two styles of jeans are 90 meters and manufacturing
time is 78 hours weekly. Style A requires 2 meters and 2 hours to finish, while Style B needs 3
meters and 2 hours. The market have been surveyed and the marketing manager feels that no
more than 45 units of Style A can be sold weekly. If the contribution to profit (net) of each of
Style A and B are P60 and P50 respectively, how many units of Style A and Style B jeans should
be produced and sold in order to maximize the weekly profit?

Solution:

Style A Style B Total

Raw Materials 2m 3m 90 m
Manufacturing Time 2 hrs 2 hrs 78 hrs
Profit P60/u P50/u

I. Decision variables:

Let x = No. of units of Style A to be produced and sold

y = No. of units of Style B to be produced and sold

II. Objective function

Max. P = 60x +50y

III. Subject to:

2x + 3y ≤ 90 Explicit
2x + 2y ≤ 78 Constraints
x ≤ 45

3
 x;y≥0 Implicit constraint

IV. Graph:

2x + 3y = 90 2x + 2y = 78

P0 (0,0) max P = 60(0) + 50(0)

=0

P1 (0,30) max P = 60(0) + 50(30)

= P1,500

P3 (27,12) max P = 60(27) + 50(12)

= P2,220

P4 (39,0) max P = 60(39) + 50(0)

= P2,340 (maximum)

V. Decision: The factory should produce 39 units of Style A and 0 units of Style B to
maximize profit to P2,340 per week.

Exercise:

A manufacturing firm produces two products, A and B. Each of these products must be
processed through two different machines. One machine has available capacity of 24 hours and
the second machine has 16 hours. Each unit of product A needs 2 hours on both machines, while
each unit of product B requires 3 hours on the first and one hour on the second machine. The
contribution to profit of each unit of A is P10 and each unit of B is P12. If the objective of the
firm is to maximize profit, how many units of products A and B should be produced within the
limits of available machine capacities?

-END-