Mathematics · Linear Programming
The correct sequence of steps in the Big-M method for solving a Linear Programming Problem is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Introduce artificial variables → Set up Big-M objective → Apply simplex method → Remove artificial variables if they remain in basis✓
- 2Convert to standard form → Check feasibility → Iterate simplex → Report solution
- 3Find corner points → Evaluate objective function → Select optimal
- 4Formulate dual → Solve dual → Recover primal solution
Correct answer
Introduce artificial variables → Set up Big-M objective → Apply simplex method → Remove artificial variables if they remain in basis
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