Mathematics · Linear Programming
Consider the linear programming primal problem: Maximize z = 2x1 + x2 Subject to: x1 - x2 ≤ 4 x1 - x2 ≤ 2 x1, x2 ≥ 0 What is the status of its dual problem?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Dual feasible and bounded
- 2Dual infeasible✓
- 3Dual feasible and unbounded
- 4Dual optimal solution exists
Correct answer
Dual infeasible
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