On incomplete Lagrange function and saddle point optimality criteria in mathematical programming (Q1589940): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4135211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in nonlinear fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized fractional programming duality: A parametric approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is invexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sufficiency of the Kuhn-Tucker conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theorem for non-linear programming / rank
 
Normal rank

Latest revision as of 11:17, 3 June 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
    0 references
    0 references
    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
    0 references
    incomplete Lagrange functions
    0 references
    saddle point optimality criteria
    0 references
    generalized convexity
    0 references
    0 references