Читать книгу Multi-parametric Optimization and Control - Efstratios N. Pistikopoulos - Страница 63

Let each active set of an mp‐LP problem be a node in the set of solutions . Then the nodes and are connected if (i) there exists a such that and are both optimal active sets and (ii) it is possible to pass from to by one step of the dual simplex algorithm. The resulting graph is fully defined by the nodes as well as all connections , i.e. .