Chapter Contents |
Previous |
Next |

The NLP Procedure |

Two algorithms are used to obtain a feasible starting point.

- When only boundary constraints are specified:

- If the parameter
*x*_{j}, , violates a two-sided boundary constraint (or an equality constraint) , the parameter is given a new value inside the feasible interval, as follows: - If the parameter
*x*_{j},*j*= 1, ... ,*n*, violates a one-sided boundary constraint or , the parameter is given a new value near the violated boundary, as follows:

- If the parameter
- When general linear constraints are specified, a feasible point is computed by the algorithm of Schittkowski and Stoer (1979), that may be quite far from a user-specified infeasible point.

Chapter Contents |
Previous |
Next |
Top |

Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.