Language Reference

NLPFEA Call

computes feasible points subject to constraints

CALL NLPFEA( xr, x0, blc <,par>);

See the section "Nonlinear Optimization and Related Subroutines" for a listing of all NLP subroutines. See Chapter 11 for a description of the inputs to and outputs of all NLP subroutines.

The NLPFEA subroutine tries to compute a point that is feasible subject to a set of boundary and linear constraints. You can specify boundary and linear constraints that define an empty feasible region, in which case the subroutine returns missing values.

You can specify the following input arguments with the NLPFEA subroutine:

The NLPFEA subroutine returns the xr argument. The result is a vector containing either the n coordinates of a feasible point, which indicates that the subroutine was successful, or missing values, which indicates that the subroutine could not find a feasible point.

The following statements call the NLPFEA subroutine with the constraints from the Betts problem (see the section "Constrained Betts Function") and an initial infeasible point x_0=(-17,-61). The subroutine returns the feasible point (2,-50) as the vector XFEAS.

  
    con = {  2. -50.  .   ., 
            50.  50.  .   ., 
            10.  -1. 1. 10.}; 
    x = {-17. -61}; 
    call nlpfea(xfeas,x,con);
 

Previous Page | Next Page | Top of Page