PhongTran12122001
New member
- Joined
- Jun 14, 2021
- Messages
- 1
Hi everybody. While solving an exercise in the book Introduction to Linear optimization, I encountered a difficult problem to solve. Hope everyone can help me. Have a nice day.
My exercise
"Consider a polyhedron in standard form, and let x, y be two different basic feasible solutions. If we are allowed to move from any basic feasible solution to an adjacent one in a single step, show that we can go from x to y in a finite number of steps."
My exercise
"Consider a polyhedron in standard form, and let x, y be two different basic feasible solutions. If we are allowed to move from any basic feasible solution to an adjacent one in a single step, show that we can go from x to y in a finite number of steps."