Mathematics · Linear Programming
Match the LP duality concepts in List-I with their corresponding statements in List-II: List-I A. Weak Duality Theorem B. Strong Duality Theorem C. Complementary Slackness D. Shadow Price List-II I. At optimum, primal slack × dual variable = 0 II. If primal has optimal solution, so does dual with equal objective values III. The dual objective value is always ≤ primal objective value for maximization problems IV. Rate of change of objective value per unit change in RHS constraint
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-IV, B-I, C-II, D-III
- 2A-I, B-II, C-III, D-IV
- 3A-II, B-III, C-IV, D-I
- 4A-III, B-II, C-I, D-IV✓
Correct answer
A-III, B-II, C-I, D-IV
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Linear Programming MCQs →Want more practice questions on Linear Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming