A.
MAXIMIZE: Z = -3 X1 + 1 X2 |
-1 X1 + 1 X2 ≤ 4 1 X1 + 0 X2 ≤ 8 |
X1, X2 ≥ 0 |
B.
MAXIMIZE: Z = 1 X1 + 0 X2 |
-1 X1 + 1 X2 ≤ 4 1 X1 + 0 X2 ≤ 8 |
X1, X2 ≥ 0 |
So we see from graph that A is the solution for part A and B and C are solution for B.
C.
As we see from graph that A is the solution for part A and B and C are solution for B, it is not possible to have both maximized at the same time, hence it is not possible to have maximized at the same time.
25 Consider the multiobjective optimization mod- 2- el max XI max -3x x2 s.t. ri+ x2...
2. Consider the following linear model where C1 has not yet been defined. Max s.t. z = C1x1 + x2 X1 + x2 = 6 X1 + 2.5x2 < 10 X1 > 0, x2 > 0 Use the graphical approach that we covered to find the optimal solution, x*=(x1, xỉ) for all values of -00 < ci so. Hint: First draw the feasible region and notice that there are only a few corner points that can be the optimal solution....
2. Consider the following linear model where c has not yet been defined. Max z = C1x1 + x2 s.t. X1 + X2 <6 X1 + 2.5x2 < 10 X1 2 0,X220 Use the graphical approach that we covered to find the optimal solution, x*=(x,x) for all values of - Sci so Hint: First draw the feasible region and notice that there are only a few corner points that can be the optimal solution. Also remember that if the objective...
2. Consider the following linear model where c has not yet been defined. Max z = C1x1 + x2 s.t. X1 + X2 <6 X1 + 2.5x2 < 10 X1 2 0,X220 Use the graphical approach that we covered to find the optimal solution, x*=(x,x) for all values of - Sci so Hint: First draw the feasible region and notice that there are only a few corner points that can be the optimal solution. Also remember that if the objective...