Mathematics · Linear Programming
Consider the linear programming problem: Maximize z = 5x1 + 2x2 + 3x3 - x4 + x5 Subject to: x1 + 2x2 + 2x3 + x4 = 83x1 + 4x2 + x3 + x5 = 7 x1, x2, x3, x4, x5 ≥ 0 Starting with initial basic variables {x4, x5}, what is the basic feasible solution after iteration 1 of the Simplex method?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1There is no basic feasible solution for this problem
- 2x1 = 0, x2 = 5, x3 = 0, x4 = 1, x5 = 0, z = 10
- 3x1 = 1, x2 = 2, x3 = 1, x4 = 0, x5 = 0, z = 12
- 4x1 = 0, x2 = 0, x3 = 4, x4 = 0, x5 = 3, z = 15✓
Correct answer
x1 = 0, x2 = 0, x3 = 4, x4 = 0, x5 = 3, z = 15
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