Find the optimal solution for the following linear program using
the graphical method.
Let: X1 = the number
of hats to produce per day
X2 = the number of shirts
to produce per day
Maximize Profit
Z = 2X1+6X2
St:
8X1+10X2≤ 80 (1)
4X1+8X2≥ 32
(2)
5X1≤20
(3)
X1, X2≥0
What is the optimal number of hats and shirts to produce?
What is the maximum profit with these constraints?
How many extreme points (possible optimal points) are there in
the feasible region?
Are there any redundant constraints and if so what are they?
Which constraints are binding?





