On various duality theorems in nonlinear programming (Q1078078)

From MaRDI portal
Revision as of 14:33, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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