Mathematics · Linear Programming
In a Linear Programming Problem solved by the Simplex method, for a Basic Feasible Solution (BFS) to remain optimal, which condition must hold for all non-basic variables in a maximization problem?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Cj - Zj ≤ 0✓
- 2Cj - Zj = 0 for basic variables
- 3Cj - Zj > 0 only
- 4Cj - Zj ≥ 0
Correct answer
Cj - Zj ≤ 0
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