The Linearization Method
- 245 Downloads
In this section we consider a method for solving a general mathematical programming problem with no convexity assumptions on the functions involved. One important feature of this method is that it is able to take account of nonlinear equality-type constraints, which form a stumbling block for most other methods.
Unable to display preview. Download preview PDF.