Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Game theory: Nash, minimax, LP
·
Module 3
Linear Programming and Duality Theory
1
Formulating Linear Programs in Standard Form
Formulate a problem as a linear program (LP) in standard form, identifying the objective, decision variables, and constraints.
2
Duality in Linear Programming
Construct the dual program for a given primal LP.
3
Weak Duality Theorem in LP
State and prove the Weak Duality Theorem for linear programming.
4
Strong Duality Theorem: Conditions and Implications
State the Strong Duality Theorem and outline its conditions and implications.
Previous module
Zero-Sum Games and the Minimax Theorem
Next module
Proving Minimax using LP Duality