Mathematics · Linear Programming
Consider the following Linear Programming Problem (LPP): Maximize z = x1 + x2 Subject to the constraints: x1 + 2x2 ≤ 2000 x1 + x2 ≤ 1500 x2 ≤ 600 and x1, x2 ≥ 0 The optimal solution of the above LPP is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1x1 = 750, x2 = 750, z = 1500
- 2x1 = 500, x2 = 1000, z = 1500
- 3x1 = 1000, x2 = 500, z = 1500
- 4More than one of the above✓
Correct answer
More than one of the above
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