Philippine School of Business Administration

826 R. PAPA STREET, SAMPALOC MANILA

LINEAR PROGRAMMING: MAXIMIZATION MODEL

 It is a mathematical technique which permits the determination of the best use of
available resources. The simplest linear programming application is the maximization
and in this chapter, we will discuss the maximization model using two variables and three
constraints.

 The maximization model starts with an objective function with the purpose of
maximizing the a goal which can be in the form of profits, sales, target audience, number
of customers, or any variable wherein more is desired.

Objective function:
Maximize 𝑧 = 0𝑥1 + 0𝑥2
Constraints:
0𝑥1 + 0𝑥2 ≤ 𝐴
0𝑥1 + 0𝑥2 ≤ 𝐵
0𝑥1 + 0𝑥2 ≤ 𝐶
𝑥1, 𝑥2 ≥ 0 Non-negative constraints.
Graphical Method:
The graphical method of solving of linear programming problem uses the corner point
technique drawn on a chart. This is, however possible if there are only two variables due to
the complexity of drawing a graph with three or more variables. In this method on variable
can represent the x-axis and the other the y-axis.
Clear Shampoo:
Geena is the Production Manager of Clear Shampoo and she wants to determine the
production mix that will result in maximum profit. She is able to determine the data
necessary for her to make a decision. It will take five minutes to mix 1 case of men’s
shampoo and 10 minutes to mix 1 case of women’s shampoo and she has a total of 100
minutes available for the mixing process per day. It will take 7 minutes to bottle 1 case of
men’s shampoo and 7 minutes to bottle 1 case of women’s shampoo and she has a total of
84 minutes available for the bottling process per day. It will take 9 minutes to pack 1 case of
men’s shampoo and 5 minutes to pack women’s shampoo and she has a total of 90 minutes
available for packing process per day. She will earn $6 for every case of men’s shampoo
produced and $8 for every case of women’s shampoo produced.
How many cases of men’s shampoo and women’s shampoo should be produced per day to
maximize profits? How much is the total profit? Geena wants to solve the problem using the
graphical method.

Solution:
Maximize: 𝑧 = 6𝑥1 + 8𝑥2
Constraints: (Subject to :)
5𝑥1 + 10𝑥2 ≤ 100 - Mixing
7𝑥1 + 7𝑥2 ≤ 84 - Bottling
9𝑥1 + 5𝑥2 ≤ 90 - Packing
𝑥1 , 𝑥2 ≥ 0 - Non negative

Dominic Q. Taday
 Philippine School of Business Administration
826 R. PAPA STREET, SAMPALOC MANILA

Minimization Problem:

The minimization model starts with an objective function with the purpose of minimizing a
goal, which can be in the form of cost, travel time, distance, energy, or any variable wherein
less is desired.

Kraft:
Jacob is the purchasing manager of KRAFT foods and he wants to determine the supply mix
that will result on minimum cost. He is able to determine the data necessary for him to make
a decision. A gallon of Alaska milk can produce 5 cases of cheese, 7 cases of butter, and 9
cases of cream. A gallon of Nestle milk can produced 11 cases of cheese, 8 cases of butter,
and 4 cases of cream. He must produce at least 110 cases of cheese, 112 cases of butter, and
72 cases of cream per day. Alaska milk cost $50 per gallon while Nestle milk costs $55 per
gallon.
How many gallons of Alaska milk and Nestle milk should be purchase per day to minimize
cost? How much is the total cost?

Solution:
Minimize: 𝑧 = 50𝑥1 + 55𝑥2
Constraints: (Subject to :)
5𝑥1 + 11𝑥2 ≥ 110 - Cheese
7𝑥1 + 8𝑥2 ≥ 112 - Butter
9𝑥1 + 4𝑥2 ≥ 72 - Cream
𝑥1 , 𝑥2 ≥ 0 - Non negative

Dominic Q. Taday