On various duality theorems in nonlinear programming
From MaRDI portal
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.
Recommendations
Cites work
- A duality theorem for non-linear programming
- A Strict Converse Duality Theorem in Nonlinear Programming
- Convex Analysis
- Generalization of some duality theorems in nonlinear programming
- scientific article; zbMATH DE number 3885664 (Why is no real title available?)
- scientific article; zbMATH DE number 3936949 (Why is no real title available?)
- scientific article; zbMATH DE number 3557536 (Why is no real title available?)
- Invex functions and constrained local minima
- On Strict Converse Duality In Nonlinear Programming
- On sufficiency of the Kuhn-Tucker conditions
- Seven Kinds of Convexity
Cited in
(18)- Sufficient optimality conditions and duality for a quasiconvex programming problem
- Higher-order generalized Studniarski epiderivative and its applications in set-valued optimization
- On a theorem due to Crouzeix and Ferland
- On sufficiency and duality for generalised quasicnvex nonsmooth programs
- scientific article; zbMATH DE number 4199475 (Why is no real title available?)
- scientific article; zbMATH DE number 4160490 (Why is no real title available?)
- On Strict Converse Duality In Nonlinear Programming
- A Note on Strict Converse Duality in Nonlinear Programming
- scientific article; zbMATH DE number 4010221 (Why is no real title available?)
- Generalised convexity and duality in multiple objective programming
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
- Hanson's duality theorem in nonsmooth programming
- On Nondifferentiable Quasiconvex Programming Problem
- Optimality Conditions in Multiobjective Optimization Problems
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- Duality for multiobjective programming involving n-set functions
- An -approximation approach to duality in mathematical programming problems involving r-invex functions
This page was built for publication: On various duality theorems in nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078078)