Exercise 2.4 We know that every linear programming problem can be con- verted to an equivalent...

Transcribed Image Text:

Exercise 2.4 We know that every linear programming problem can be con- verted to an equivalent problem in standard form. We also know that nonempty polyhedra in standard form have at least one extreme point. We are then tempted to conclude that every nonempty polyhedron has at least one extreme point. Ex- plain what is wrong with this argument. Exercise 2.4 We know that every linear programming problem can be con- verted to an equivalent problem in standard form. We also know that nonempty polyhedra in standard form have at least one extreme point. We are then tempted to conclude that every nonempty polyhedron has at least one extreme point. Ex- plain what is wrong with this argument.

Answer rating: 100% (QA)

It is that nonempty polyhedra in standard form have at le... View the full answer