Characterization of local solutions for a class of nonconvex programs
| ISSN: |
1573-2878
|
|---|---|
| Keywords: |
Nonconvex programming ; mathematical programming ; operations research ; sufficiency conditions ; necessary conditions
|
| Source: |
Springer Online Journal Archives 1860-2000
|
| Topics: |
Mathematics
|
| Notes: |
Abstract A nonconvex programming problem, which arises in the context of application of Benders' decomposition procedure to a class of network optimization problems, is considered. Conditions which are both necessary and sufficient for a local maximum are derived. The concept of a basic local maximum is introduced, and it is shown that there is a finite number of basic local maxima and at least one such local maximum is optimal.
|
| Type of Medium: |
Electronic Resource
|
| URL: |