A new class of generalized convex programming
From MaRDI portal
Recommendations
- On sufficiency and duality for generalized quasiconvex programs
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Optimality and duality with generalized convexity
- Nonlinear programming with Hanson-Mond classes of functions
- scientific article; zbMATH DE number 59929
Cites work
- B-vex functions
- Further Generalizations of Convexity in Mathematical Programming
- Generalization of preinvex and B-vex functions
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- Necessary and sufficient conditions in constrained optimization
- On efficiency and duality for multiobjective programs
- On sufficiency of the Kuhn-Tucker conditions
- Optimality criteria in mathematical programming involving generalized invexity
- Strong and Weak Convexity of Sets and Functions
- Strong convexity of sets and functions
- The essence of invexity
Cited in
(4)- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- scientific article; zbMATH DE number 3883964 (Why is no real title available?)
- scientific article; zbMATH DE number 1399496 (Why is no real title available?)
- On Kuhn-Tucker problem related to \(\eta\)-convex functions
This page was built for publication: A new class of generalized convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767394)