Mathematics · Linear Programming
In Linear Programming solved via the Simplex Method, a Basic Feasible Solution (BFS) is said to be degenerate when:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1no feasible solution region exists
- 2the objective function value becomes unbounded
- 3at least one basic variable takes the value zero✓
- 4the number of basic variables equals the number of constraints
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