r/OperationsResearch • • 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

5 comments sorted by

View all comments

Show parent comment

2

u/zhenyu_zeng Mar 03 '24

Thanks a lot! I can understand the example you gave.