Mathematics · Linear Programming
If x0 is a feasible solution to the primal Linear Programming Problem: Max Z = cx, subject to Ax ≤ b, x ≥ 0, and w0 is a feasible solution to its dual problem, then according to the Weak Duality Theorem, which of the following inequalities is always true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1cx0 > w0Tb
- 2cx0 ≥ bTw0
- 3cx0 = bTw0
- 4cx0 ≤ bTw0✓
Correct answer
cx0 ≤ bTw0
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