On incomplete Lagrange function and saddle point optimality criteria in mathematical programming (Q1589940): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jmaa.2000.7014 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2029061302 / rank | |||
Normal rank |
Revision as of 20:38, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On incomplete Lagrange function and saddle point optimality criteria in mathematical programming |
scientific article |
Statements
On incomplete Lagrange function and saddle point optimality criteria in mathematical programming (English)
0 references
19 December 2000
0 references
Starting from a partitioning of the constraints, the authors introduce incomplete Lagrange functions for three classes of mathematical programming problems and use them to establish saddle point optimality criteria under generalized convexity assumptions.
0 references
incomplete Lagrange functions
0 references
saddle point optimality criteria
0 references
generalized convexity
0 references