Mathematics · Linear Programming
The Linear Programming Problem: Maximize Z = 2.5x 1 + x 2 subject to: 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 x 1 , x 2 ≥ 0 has:
- 1An unbounded solution
- 2No feasible solution
- 3A unique optimal value of Z with infinite number of feasible solutions
- 4A unique optimal value of Z with a unique optimal solution✓
Correct answer
A unique optimal value of Z with a unique optimal solution
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!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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