1.

Solution and Answer

The graph of the equation

Feasible Region

The extreme point in the feasible region

(0,6)

(0,2)

(1.8,4,8)

(2.857,0.571)

Input the extreme point in to the objective function 2X+Y

Solution(X,Y) Corresponding
objective value
2X+Y
A (0,6) 6
B (0,2) 2
C (1.8,4,8) 8.4
D (2.857,0.571) 6.285
Answer
The maximum value corresponding to the value 2X+Y is 8.4 at point (1.8,4,8)
 2. Solution and Answer
Leary Chemical Manufactures
A B C Cost
Process 1 3 1 1 4
Process 2 1 1 0 1
Minimum 10 5 3
LP Variable:

X=Process 1

Y=Process 2

Objective Function:

Minimize: 4x+y

Subject to :
3X+Y>=10 #Chemical A Constraint
X+Y>=5 #Chemical B Constraint
X>=3 #Chemical C Constraint
X>=0#Non-Negativify Constraint
Y>=0#Non-Negativify Constraint
Using Solver in Excel:

Using Solver in Python (Linear programming using the PuLP):

The optimal solution for this problem is when process 1 used for 3 hours and process 2 used for 2
hours, resulting 14 dollars for the cost
 3. Solution and Answer

Manufacturing Plant
Bookshelves Couches Worktables Available
Labor 12 14 16 400
Lumber 40 22 60 1000
Cost 6 5 8

LP Variable:

X=Bookshelves

Y= Couches

Z= Worktables

Objective Function:

Maximize: 6X+5Y+8Z

Subject to:
12X+14Y+16<=400 #Labor Constraint
40X+5Y+8Z<=8 #Lumber Constraint
X>=0#Non-Negativify Constraint
Y>=0#Non-Negativify Constraint

Using Solver in Excel:

Using Solver in Python (Linear programming using the PuLP):

The optimal solution for this problem is when the manufacturing plant produce the 17
Bookshelves, 13 Couches and 0 Worktables (consider to take rounded down due to
the lumber restrictions and waste might occur during the production) resulting 167
dollars in profit (by input the rounded number to the objective function)