Mathematics · Linear Programming
In Linear Programming, every primal problem has a corresponding dual. Consider the following statements about duality in Linear Programming: (a) If a linear programming problem is of the maximizing type, then its dual is of the minimizing type. (b) Both the primal and dual problems have the same optimal objective value, if an optimum exists. (c) The dual of the dual of a linear programming problem is the primal problem. (d) If a maximizing linear programming problem has 'less than or equal to' (≤) constraints, its dual problem will have 'greater than or equal to' (≥) constraints. Which of the following options is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1All (a), (b), (c), and (d) are correct✓
- 2(a), (b) and (c) are correct
- 3Only (c) and (d) are correct
- 4Only (a) and (b) are correct
Correct answer
All (a), (b), (c), and (d) are correct
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