Question: sa e.la nd 3. An integer programming (maximization) problem was first solved as a linear programming problem, and the objective function value (profit) was $253,67.

sa e.la nd 3. An integer programming
sa e.la nd 3. An integer programming (maximization) problem was first solved as a linear programming problem, and the objective function value (profit) was $253,67. The two decision viriables ex Y) in the problem bud values of X - 12.45 and Y32.75. If there is a single optimal solution. which of the following must be true for the optimal integer solution to this problem? A) X-12-32 B) x 12 Y-33 C) The objective function value must be less than $253.67. D) The objective function value will be greater than $253.67 E) None of the above answers is correct

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!