On various duality theorems in nonlinear programming (Q1078078): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theorem for non-linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strict Converse Duality Theorem in Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Strict Converse Duality In Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seven Kinds of Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invex functions and constrained local minima / 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: Generalization of some duality theorems in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133421 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00938952 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029978297 / rank
 
Normal rank

Latest revision as of 08:45, 30 July 2024

scientific article
Language Label Description Also known as
English
On various duality theorems in nonlinear programming
scientific article

    Statements

    On various duality theorems in nonlinear programming (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Recently, Gulati and Craven and Mond and Egudo established strict converse duality theorems for some of Mond-Weir duals for nonlinear programming problems. Here, we establish various duality theorems under weaker convexity conditions that are different from those of Gulati and Craven, Mond and Weir, and Mond and Egudo.
    0 references
    Mond-Weir duals
    0 references
    duality theorems
    0 references
    weaker convexity conditions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references