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

Loose claims about how fast simplex is

One set of notes I read implied simplex is efficient, another implied it is exponential, and neither distinguished worst case from observed behaviour on real instances. The honest statement is that certain pivot rules have bad worst-case families while the method performs well in practice, and that other methods carry polynomial guarantees. Writing it vaguely leaves students with a slogan instead of a fact.
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.