Mathematics · Linear Programming
In the simplex method for linear programming, a basic feasible solution is degenerate if:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The objective function has multiple optimal solutions
- 2At least one basic variable takes the value zero✓
- 3All constraints are equality constraints
- 4The feasible region is unbounded
Correct answer
At least one basic variable takes the value zero
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