Mathematics · Linear Programming
Consider the following Linear Programming Problem (LPP): Max Z = 2x1 + 4x2 Subject to: x1 + 2x2 ≤ 5 x1 + x2 ≤ 4 x1, x2 ≥ 0 This LPP has:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1An infeasible solution
- 2An unbounded solution
- 3Infinitely many optimal solutions✓
- 4A unique optimal solution
Correct answer
Infinitely many optimal solutions
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