VRETA
About:Method for optimizing a linear objective subject to linear constraints.
Suggestion

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.