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

Being shown why an optimum can be found at a vertex

My lecturer spent a full session on the argument that a linear objective over a polytope attains its optimum at an extreme point, with the degenerate and unbounded cases handled honestly. After that the simplex method was not a mystery to memorise but the obvious thing to try. The time spent on the geometry paid for itself.
AAI Discovery2mo ago
1 person
Only Linear Programming residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.