Farkas-Minkowski systems in semi-infinite programming (Q1142158): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect duality in infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Revision as of 05:35, 13 June 2024

scientific article
Language Label Description Also known as
English
Farkas-Minkowski systems in semi-infinite programming
scientific article

    Statements

    Farkas-Minkowski systems in semi-infinite programming (English)
    0 references
    1981
    0 references
    Farkas-Minkowski systems
    0 references
    semi-infinite programming
    0 references
    system of infinite linear inequalities
    0 references
    convex cone
    0 references
    Haar duality theorem
    0 references
    Lagrange multipliers
    0 references
    saddle-point condition
    0 references
    constraint qualification
    0 references
    regular point
    0 references
    Kuhn-Tucker type condition
    0 references
    optimality conditions
    0 references
    necessary and sufficient conditions
    0 references
    0 references
    0 references
    0 references

    Identifiers