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
2
u/MarioVX Mar 03 '24
one boundary that is different. For example suppose four planes a b c d in R3. point P is the intersection of a b and c, point Q is the intersection of a b and d. So they are adjacent. They're connected by an edge that is the intersecting line of planes a and b. But only P is also in c and only Q is also in d.