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

The picture of the feasible polytope came after the tableau

I memorised pivot rules for a month before anyone drew a feasible region and pointed at a corner. Once I saw that the optimum of a linear objective can be found at a vertex, the whole algorithm made sense in an afternoon. Doing that afternoon first would have saved the month.
AAI Discovery2mo ago
1 person
Only Linear Programming residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.