Lecture On Bus Math 3 - Linear Progamming - Minimization
Lecture On Bus Math 3 - Linear Progamming - Minimization
The technique of using graphical method in solving a maximization problem works equally well
in solving a minimization problem. All the different steps in solving maximization problems are
followed except that instead of solving for maximum profit, we now solve for minimum cost.
Illustration
Dr. David Joseph Arambulo, the owner of Arambulo’s Poultry and Swine Farm wants to mix a
specially blended feed supplement for the farm’s chicken layers. On his first try he wants to mix
250 kilos of this mixture but chemical constraints dictate that no more than 200 kilos of
ingredient P and at least 100 kilos of ingredient C should be used. If ingredients P and C cost P40
and P30 per kilo, respectively, how many kilos of each of the two ingredients should be mixed to
minimize his cost?
Solution
I. Decision Variables:
IV. Graph:
1
To determine the minimum cost, substitute the coordinates of points P1 and P2 in the
objective function.
P1 (0,250)
Min. Cost = P40x + P30y
= P40 (0) + 30(250)
= P7,500
P2 (150,100)
Min. Cost = P40(150) + 30(100)
= 6,000 + 3,000
= P9,000 (minimum)
V. Decision:
Dr. David Joseph Arambulo can minimize the cost of producing the feed
supplement to P9,000 by mixing 150 kilos of ingredient P and 100 kilos of ingredient C.
Illustration 2
Armbulo Company owns two mills. Company policy dictates that the company should operate at
least as many hours at the second mill as at the first. The first mill operates at a maximum of 40
hours per week and the second mill at a maximum of 60 hours. For each hour of operation, the
first mill can produce 3 tons of finished product, while the second mill can produce 4 tons. The
company has a contract to supply customers for at least 175 tons of finished product. It costs
P2,000 per hour to operate the first mill and P4,000 per hour for the second mill. If the
company’s objective is to minimize the cost, how many hours in a week should each mill operate
to fulfill the company’s commitments to its customers at the least cost?
I. Decision Variables:
2
II. Objective Function:
x1 < 40
x2 < 60
3x1 + 4x2 ≥ 175
x2 > x1
x1 ≥ 0 ; x2 ≥ 0
IV. Graph
x1 = 40
x2 = 60
3x1 + 4x2 = 175
x2 = x1
The shaded or hatched portion is the feasible region. Since we are looking for the
minimum cost, the iso-cost line passing the corner point (25,25) and the nearest to the
origin is preferred. So that the optimum solution is x1 = 25 and x2 = 25.
V. Decision: For the company to minimize its operation costs to P150,000 per week, the
company has to operate each unit for 25 hours weekly.
-END-