Please verify that the error is present in the most recent revision before reporting. Done
Chapter number or note title: Linear Programming Algorithms
Page number: 3
Error description: The following equivalence is false:
The Weak Duality Theorem implies that the value of every feasible basis is less than
or equal to the value of every locally optimal basis; equivalently, every feasible vertex
is higher than every locally optimal vertex.
Suggested fix (if any): It should be:
The Weak Duality Theorem implies that the value of every feasible basis is less than
or equal to the value of every locally optimal basis; equivalently, every feasible vertex
is no lower than every locally optimal vertex.
Please verify that the error is present in the most recent revision before reporting. Done
Chapter number or note title: Linear Programming Algorithms
Page number: 3
Error description: The following equivalence is false:
Suggested fix (if any): It should be: