Consider the following problem: max-91 +2.02 + 23 subject to 3.01 +32 - 4x3 < 4, 21-22-13 < 10, 2- 2.x2 + 6x3 < 9, 21, 2
Posted: Sat Feb 19, 2022 3:21 pm
Consider the following problem: max-91 +2.02 + 23 subject to 3.01 +32 - 4x3 < 4, 21-22-13 < 10, 2- 2.x2 + 6x3 < 9, 21, 22, 23 > 0. • Argue (without using Python and Gurobi) whether this problem has or does not have an optimal solution. • If you conclude that the problem is unbounded, find a feasible solution with the objective function > 1,000.