Machine-translated by Google. Questions are authored in English.
Top

Discussion

For a linear programming problem, which one of the following statements is FALSE?

  • A.If a constraint is an equality, then the corresponding dual variable is unrestricted in sign
  • B.Both primal and its dual can be infeasible
  • C.If primal is unbounded, then its dual is infeasible
  • D.Even if both primal and dual are feasible, the optimal values of the primal and the dual can differ

Answer: D

The FALSE statement is Even if both primal and dual are feasible, the optimal values of the primal and the dual can differ.

By the strong duality theorem, if both the primal and the dual are feasible, both have optimal solutions and their optimal objective values are equal. So the values cannot differ.

The other three are true. An equality constraint in the primal gives a dual variable unrestricted in sign. Both problems can be infeasible at once; standard small examples exist. And by weak duality, an unbounded primal leaves no feasible point for the dual, since any dual feasible value would bound the primal.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.