Problem A is a two-variable linear programming problem with a maximization objective function. Problem B is a two variable pure integer programming problem obtained from Problem A by requiring the variables to be integers and leaving all other things unchanged. If Problem A has an optimal solution with integer objective function value, then Problem B must have an optimal solution.

Question

Quizplus · Accepted Answer

The optimal solution for Problem A being an integer does not guarantee that Problem B will have a feasible solution, as the integer constraints in Problem B may make the feasible region empty or change the optimal solution.

Problem a Is a Two-Variable Linear Programming Problem with a Maximization