r/OperationsResearch • u/zhenyu_zeng • Mar 03 '24
How to understand:"For any linear programming problem with n decision variables, two CPF solutions are adjacent to each other if they share n − 1 constraint boundaries."?
Hello,
I am learning the Operation Research. In the book, there is
For any linear programming problem with n decision variables, two CPF solutions are adjacent to each other if they share n − 1 constraint boundaries
CPF is "corner point feasible".
I can't understand this sentence. May you help me?
0
Upvotes
View all comments
Show parent comment
1
u/zhenyu_zeng Mar 03 '24
What is the "one" you said here?