In this program
- Linear programming
- Nonlinear optimization
- Discrete and network optimization
Linear programming
Optimization & linear programming · STEM / applied
Linear programming problems: standard form and geometry
Objectives
- Linear programming problems: standard form and geometry
- Feasible regions and vertices
- The fundamental theorem of LP
- Simplex method
- Termination
- Duality: weak and strong duality (statements)
- Sensitivity analysis
- Shadow prices (introduction)
Study materials
- Study guideComing soon
- Exam StrategyComing soon
- Common MistakesComing soon
- WorksheetsComing soon
- Word problemsComing soon
- Mixed PracticeComing soon
- Multi-Unit ProblemsComing soon
- ReviewComing soon
- Practice testComing soon
- Answer keyComing soon
Interactive practice
Quizzes, typed answers, and flashcards for this unit — coming soon.
- Coming soon
Quiz
Multiple-choice questions with instant feedback
- Coming soon
Typed practice
Type answers and check them
- Coming soon
Flashcards
Vocabulary and key facts
- Coming soon
Mixed quiz
Harder mixed review for this standard