Question: A linear programming problem: minimize = 41 + 2 Subject to 81 + 22 16 41 + 22 12 1 6 2 4 1, 2
A linear programming problem:
minimize = 41 + 2
Subject to
81 + 22 16
41 + 22 12
1 6
2 4
1, 2 0
Which of the following changes will allow the problem to have multiple optimal solutions? If there is more than one answer, choose all:
a) Increase of the coefficient of 1 on the objective function to 2
b) Increase of the coefficient of 1 on the objective function to 4
c) Increase of the coefficient of 2 on the objective function to -8
d. Decrease of the coefficient of 1 on the objective function to -8
e) None
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
