Operations research
10 seconds
10-second challenge: find the LP optimum
Ten seconds. Three corners. Pick the max. Go.
Quick check · tap an answer to continue
Lesson notes
Write an LP model from a word problem: define variables, objective, constraints, non-negativity
Key points
- Z values: 0, 20, 15+6=21, and 12.
- The largest is 21 at corner (3,1.5), where both constraints meet.
Takeaway: Evaluate Z at every corner point; the best one is optimal.
Quick check: Max Z=5x+4y. Corners: (0,0),(4,0),(3,1.5),(0,3). Where is the optimum?
- (4,0)
- (3,1.5)
- (0,3)
Plug every corner into Z; the optimum is always at a vertex, never strictly inside.
linear programmingnon-negativity constraintresource constraint
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