Anzeige
Erschienen in:
1998 | OriginalPaper | Buchkapitel
Higher Order Invexity and Duality in Mathematical Programming
verfasst von : B. Mond, J. Zhang
Erschienen in: Generalized Convexity, Generalized Monotonicity: Recent Results
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In 1975 Mangasarian formulated a higher order dual to the nonlinear programming problem: Minimize ¦(x) Subject to g(x) ≥ 0. He did not prove weak duality find hence only gave a limited strong duality theorem. Subsequently, Mond and Weir gave conditions for full duality find, as well, formulated other higher order duals. Here we give invexity type conditions under which duality holds between the above problem and various higher order dual programming problems.