Solve the following linear program using both the graphical and
the simplex methods:
Max
2X1
+ 8 X2
s.t.
3X1
+ 9X2
<=
15
2X1
+ X2
>=
12
X1, X2
>=
0
Show graphically how the simplex method moves from one basic
feasible solution to another. Find the coordinates of all extreme
points of the feasible region.
From the graphic I can see there's no solution , but how to
prove it through simplex method? Thank you!
44. Consider the following linear program Max 1a+1b s.t.
5a+3b<15 3a+5b,<15 a,b >0 A. What is the optimal solution
for this problem? B. Suppose that the objective function is changed
to 1a+2b. Find the new optimal solution. I am using excel for this
homework question so I need the formulas to help not just the
answers and I also trying to figure desmos to graph the
question.
Consider the following linear program:
MAX Z = 25A + 30B
s.t. 12A + 15B ≤ 300
8A + 7B ≤ 168
10A + 14B ≤ 280
Solve this linear program graphically and determine
the optimal quantities of A, B, and the value of
Z. Show the optimal area.
For the following linear programming problem, determine the optimal
solution by the graphical solution method
Max
-x + 2y
s.t.
6x - 2y <= 3
-2x + 3y <= 6
x + y <= 3
x, y
>= 0
Consider the following linear program:
MAX Z = 25A + 30B
s.t. 12A + 15B ≤ 300
8A + 7B ≤ 168
10A + 14B ≤ 280
Solve this linear program graphically and
determine the optimal quantities of A, B, and
the value of Z. Show the optimal area.
Consider the following all-integer linear program:
Max
x1 + x2
s.t.
4x1 + 6x2 ≤ 22
x1 + 5x2 ≤ 15
2x1 + x2 ≤ 9
x1, x2 ≥ 0
and integer
Solve the LP Relaxation of this problem.
The optimal solution to the LP Relaxation is x1
= ___, x2 = .____________
Its value is ___________
Find the optimal integer solution.
The optimal solution to the LP Relaxation is x1
= _____x2 = __________
Its value is _______