Which of the following could not be a linear programming problem constraint?
A) A + B ≤ -3
B) A - B ≤ -3
C) A - B ≤ 3
D) -A + B ≤ -3

Question

Quizplus · Accepted Answer

Linear programming constraints must always contain only linear combinations of decision variables and constants, and the coefficient of each decision variable must be a constant. The constraint in choice A has a negative coefficient for one of the decision variables, which violates this rule.

Which of the Following Could Not Be a Linear Programming