Mathematics · Linear Programming

Which of the following statements correctly describe the principles of Duality Theorems in Linear Programming? A. The Weak Duality Theorem establishes that for any feasible solutions, the value of the maximization primal objective is always less than or equal to the value of the minimization dual objective. B. The Strong Duality Theorem guarantees that if either the primal or dual has a finite optimal solution, both have finite optimal solutions and their optimal objective values are equal. C. The Complementary Slackness Theorem asserts that if a primal variable is strictly positive at optimality, its corresponding dual constraint must be a strict inequality (slack). D. A corollary of the Weak Duality Theorem establishes that if the primal problem is unbounded, the corresponding dual problem must be infeasible. Choose the most appropriate answer from the options given below: