An LP maximization problem with all less-than-or-equal-to constraints and nonnegativity requirements for the decision variables is known as
A)a canonical form for a minimization problem.
B)a canonical form for a maximization problem.
C)always unbounded.
D)None of these are correct.

Question

Quizplus · Accepted Answer

A maximization problem with less-than-or-equal-to constraints and nonnegativity requirements for the decision variables can be converted to the canonical form. Therefore, option B is correct. Option A is incorrect because the problem is not a minimization problem. Option C is incorrect because the problem may or may not be unbounded, depending on the specific coefficients of the problem. Option D is incorrect because option B is correct.

An LP Maximization Problem with All Less-Than-Or-Equal-To Constraints and Nonnegativity