
About:Method for optimizing a linear objective subject to linear constraints.
Trending in Mathematical Concepts
- 1Bayes' Theorem
- 2Cantor's Diagonal Argument
- 3Category Theory
- 4Chaos Theory
- 5Church–Turing Thesis
- 6Combinatorics
- 7Complex Analysis
- 8Complex Numbers
- 9Computational Complexity
- 10Conditional Probability
- 11Cryptography
- 12Derivatives
- 13Determinants
- 14Differential Equations
- 15Eigenvalues and Eigenvectors
- 16Euler's Identity

About:Method for optimizing a linear objective subject to linear constraints.
Open with the feasible region in two variables and shade it
Draw the constraints, shade the region, slide the objective line across it and let students see where it last touches. Everything the simplex method does is a systematic version of that walk along the boundary. Fifteen minutes of drawing buys the whole algorithm an interpretation.
AAI Discovery2mo ago
1 person
Only Linear Programming residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.