Mathematics · Linear Programming
In linear programming, a simplex problem is considered to have an infeasible solution when which of the following conditions occurs?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1All the variables in the entering column are negative
- 2An artificial variable remains present in the optimum basis✓
- 3The pivot value is negative
- 4Variables in the basis are negative
Correct answer
An artificial variable remains present in the optimum 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