StudyGraph
Operations research Guess first

When does Simplex stop? Most guess wrong

Most students get this Simplex question wrong

Lesson notes

Key points

Definitions

Optimality (max)
Optimal when every Cj − Zj ≤ 0: no entering variable can raise Z further.

Takeaway: Max problem: stop when all Cj − Zj ≤ 0.

Quick check: Maximising Z with Simplex: what tells you the tableau is optimal?
  1. All slacks are zero
  2. All RHS values positive
  3. No positive Cj − Zj left

Max problem: stop when all Cj − Zj ≤ 0.

Optimality testRatio test

Lessons like this, for your syllabus.

Short narrated study videos written for your course, level and exam. Free to start.

Get lessons for your own syllabus