Linear Programming Examples

LINEAR
PROGRAMING
EXAMPLES
Linear Programming Example 1
A manufacturer of plastic chairs makes a regular model and a compact
model. Each regular model requires five hours from fabricating
department and two hours from the finishing department. Each compact
model requires four hours from the fabricating department and three
hours from the finishing department. The maximum work hours
available per week in the fabricating department is 200 while in the
finishing department, it is 108. If the company makes a profit of Php150
on each regular chair and Php135 on each compact chair, how many
chairs of each type should be manufactured per week to maximize the
total profit for the week? What is the maximum profit? Assume that all
chairs can be sold.
Here, we are asked: how many chairs of each type should be manufactured per
week to maximize the total profit for the week?
Let x = number of regular chairs

y = number of compact chairs
We want to MAXIMIZE the profit.
Generate the formula to compute for the profit using the variables we defined.
Since each regular chair gives a profit of Php150 while the compact chair gives
a profit of Php135:
P = 150x + 135y
The following are GIVEN.

Fabricating Department
Since the fabricating department can operate for a maximum of 200
hours per week and it was given that each regular chair requires five
hours from the fabricating department while each compact chair
requires four hours from the fabricating department, we can convert
these details into a mathematical sentence (specifically an inequality
because of the keyword maximum) using the variables we defined.
5x + 4y < 200
Finishing Department
Since the finishing department can operate for a maximum of 108 hours
per week and it was given that each regular chair requires two hours
from the finishing department while each compact chair requires three
hours from the finishing department, we can convert these details into a
mathematical sentence (specifically an inequality because of the
keyword maximum) using the variables we defined.
2x + 3y < 108
Consider also the non-negativity constraints for x and y, that is x (the
number of regular chairs) and y (the number of compact chairs) must
never be negative.
Written in mathematical inequality statement:
x > 0 and y>0

We can now summarize all the details gathered:
Maximize the profit P = 150x + 135 y
Subject to
5x + 4y < 200
2x + 3y < 108
x>0
y>0
We will now use the Corner Principle. Graph all the constraints in one
cartesian plane (use a graphing tool such as Desmos) and locate the corners
(or vertices) of the polygon formed representing the feasible region.
The polygon formed from the intersection of all the planes representing the
constraints is shown below. The corners (or vertices) are also indicated.
The polygon formed representing the feasible region may not be obvious right away. A
technique you may use is to flip the direction of the inequality symbols, that is change
</< to >/> and vice versa.
And so, the polygon

formed is now easily seen
and is colored white 
Create a table. On the left column, list all the corners (coordinates –
values of x and y). On the right column, evaluate the value of P using
the corresponding ordered pair:
Corners
P=150x + 135y
(x, y)
(0, 0) P=150(0)+135(0)=Php0
(0, 36) P=150(0)+135(36)=Php4,860
(24, 20) P=150(24)+135(20)=Php6,300 MAXIMUM PROFIT

A maximum profit of Php 6,300 per
(40, 0) P=150(40)+135(0)=Php6,000
week can be obtained if
24 regular chairs and
20 compact chairs are produced.
A cargo-forwarding firm is planning a major fleet expansion and will
purchase a maximum of 15 new trucks. These vehicles are supposed to
provide at least 36 tons of additional load capacity. One model holds
two tons and costs Php1.5M. A second model holds three tons and costs
Php2.4M. How many trucks of each model should the firm purchase to
provide the additional load capacity at minimal cost? What is the
minimal cost?
Here, we are asked: how many trucks of each model should be purchased to
provide the additional load capacity at minimal cost?
Let x = number of first model trucks

y = number of second model trucks
We want to MINIMIZE the cost.
Generate the formula to compute for the cost using the variables we defined.
Since the cost of a first model truck is Php1.5M while the cost of a second
model truck is Php2.4M:
C = 1.5x + 2.4y (Note: both x and y are in terms of million pesos)

The following are GIVEN.

The firm will purchase a maximum of 15 new trucks. Using
the variables defined, we can convert this into a mathematical
inequality statement (considering the keyword maximum of )
x + y < 15
Those vehicles are suppose to provide at least 36 tons of additional load
capacity.
Considering that the first model can hold two tons while the second
model can hold three tons, and taking note of the keyword at least 36
tons above.
2x + 3y > 36
Consider also the non-negativity constraints for x and y, that is x (the
number of first model trucks) and y (the number of second model
trucks) must never be negative.
Written in mathematical inequality statement:
x > 0 and y>0

We can now summarize all the details gathered:
Minimize the cost C = 1.5x + 2.4 y
Subject to
x + y < 15
2x + 3y > 36
x>0
y>0
The polygon formed from the intersection of all the planes representing the
constraints is shown below. The corners (or vertices) are also indicated.
The polygon formed representing the feasible region may not be obvious right away. A
technique you may use is to flip the direction of the inequality symbols, that is change
</< to >/> and vice versa.
And so, the polygon

formed is now easily seen
and is colored white 
Create a table. On the left column, list all the corners (coordinates –
values of x and y). On the right column, evaluate the value of C using
the corresponding ordered pair:
Corners
P=1.5x + 2.4y
(x, y)
(0, 15) P=1.5(0)+2.4(15)=Php36M
(0, 12) P=1.5 (0)+2.4 (12)=Php28.8M
(9, 6) P=1.5 (9)+2.4 (6)=Php27.9M MINIMUM COST

A minimum cost of Php27.9M can be
spent if
9 first model trucks and
6 second model trucks are
purchased.

Linear Programming Examples

Uploaded by

Linear Programming Examples

Uploaded by

LINEAR

Let x = number of regular chairs

We want to MAXIMIZE the profit.

The following are GIVEN.

Written in mathematical inequality statement:

x > 0 and y>0

Maximize the profit P = 150x + 135 y

And so, the polygon

(0, 36) P=150(0)+135(36)=Php4,860

(24, 20) P=150(24)+135(20)=Php6,300 MAXIMUM PROFIT

Let x = number of first model trucks

We want to MINIMIZE the cost.

C = 1.5x + 2.4y (Note: both x and y are in terms of million pesos)

The following are GIVEN.

Written in mathematical inequality statement:

x > 0 and y>0

Minimize the cost C = 1.5x + 2.4 y

And so, the polygon

(0, 12) P=1.5 (0)+2.4 (12)=Php28.8M

(9, 6) P=1.5 (9)+2.4 (6)=Php27.9M MINIMUM COST

You might also like