Mathematics · Linear Programming
At the current basic feasible solution (bfs) v0 ∈ ℝ5, the simplex method yields the following form of a linear programming problem in standard form: Minimize z = -x1 - 2x2 subject to: x3 = 2 + 2x1 - x2 x4 = 7 + x1 - 2x2 x5 = 3 - x1 x1, x2, x3, x4, x5 ≥ 0 Here, the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs v1 ∈ ℝ5 that best improves the objective function, which of the following represents the objective function at v1?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1z = -3 - x5 - 2x2
- 2z = -6 - 5x1 + 2x3
- 3z = -4 - 5x1 + 2x3✓
- 4z = -4 - 5x1 + 2x4
Correct answer
z = -4 - 5x1 + 2x3
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