Constraints complementary problem

The extended cuttingplane (ECP) algorithm [Westerlund and Pet-tersson, Computers and Chem. Engng. 19 S131 (1995)] is complementary to GBD. While the lower bounding problem in Pig. 3-62 remains essentially the same, the continuous variables xk are chosen from the MILP solution and the NLP (3-113) is replaced by a simple evaluation of the objective and constraint functions. As a result, only MILP problems [(3-116) plus integer cuts] need be solved. Consequently, the ECP approach has weaker upper bounds than outer approximation and requires more MILP solutions. It has advantages over outer approximation when the NLP (3-113) is expensive to solve. 

Any optimal basis for a mathematical programming problem not only must be feasible for the original constraints and satisfy the complementary slackness conditions, but also must be feasible for the equations... 

The reason we employ two rather distinct methods of inquiry is that neither, by itself, is free of open methodological issues. The method of molecular dynamics has been extensively applied, inter alia, to cluster impact. However, there are two problems. One is that the results are only as reliable as the potential energy function that is used as input. For a problem containing many open shell reactive atoms, one does not have well tested semiempirical approximations for the potential. We used the many body potential which we used for the reactive system in our earlier studies on rare gas clusters containing several N2/O2 molecules (see Sec. 3.4). The other limitation of the MD simulation is that it fails to incorporate the possibility of electronic excitation. This will be discussed fmther below. The second method that we used is, in many ways, complementary to MD. It does not require the potential as an input and it can readily allow for electronically excited as well as for charged products. It seeks to compute that distribution of products which is of maximal entropy subject to the constraints on the system (conservation of chemical elements, charge and... 

The most likely outcome of solving the complementary maxmin/minmax problems is that the maxmin problem is feasible (for each v there exists an input sequence that can satisfy the constraints) and the minmax is infeasible (there is no single input sequence that can satisfy the constraints for all v). This is unfortunate. as this outcome is the least informative as to whether a realizable controller exists. 

The simplest example of Attic in a three-dimensional space consists of an ordinary room with a parallel floor and roof as well as parallel pairs of side lateral walls. Within this simple Attic there are three (like the space dimensions) couples of mutually incompatible constraints. It is easy to generalize this problem the ny dimensions can be larger than 3 complementary constraints can be nonparallel on condition that they do not meet each other within the feasible region distances between opposite vertices in the complementary constraints can be different, but not zero. 

The Klee-Minty problem is a typical example of this class of problem where — is the nonnegativity constraint and -t- is the complementary constraint used to obtain a variable. 

It is possible to generate this kind of problem by starting from an attic with 2ny complementary constraints, by introducing more constraints or couples of complementary constraints. These new classes of problems present three additional difficulties ... 

---