Mathematics · Linear Programming
Consider the following Linear Programming problem: Maximise Z = 40x 1 + 50x 2 subject to the constraints: x 1 + 2x 2 ≤ 40, 4x 1 + 3x 2 ≤ 120, x 1 , x 2 ≥ 0. Then the optimal solution is:
- 1Z = 1360 for x 1 = 19, x 2 = 12
- 2Z = 1460 for x 1 = 24, x 2 = 10
- 3Z = 1360 for x 1 = 24, x 2 = 8✓
- 4Z = 1600 for x 1 = 30, x 2 = 8
Correct answer
Z = 1360 for x 1 = 24, x 2 = 8
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