Efficiency and generalised convexity in vector optimisation problems

DOI10.1017/S1446181100013547zbMath1177.90367OpenAlexW1977830722MaRDI QIDQ4831776

Pham Hu'u Sach, Do Sang Kim, Gue Myung Lee

Publication date: 3 January 2005

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181100013547

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)

Related Items (2)

\(L\)-invex-infine functions and applications ⋮ Multiobjective Problems with Nonsmooth Equality Constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• On sufficiency of the Kuhn-Tucker conditions
• Invex functions and generalized convexity in multiobjective programming
• Invexity and the Kuhn-Tucker theorem
• Generalization of nonhomogeneous Farkas' lemma and applications
• Infine functions, nonsmooth alternative theorems and vector optimization problems
• Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
• Proper efficiency and the theory of vector maximization
• Nondifferentiable optimization by smooth approximations
• Necessary and sufficient conditions in constrained optimization
• Mathematical methods of game and economic theory
• Invex nonsmooth alternative theorem and applications^*
• Generalized convexity in multiobjective programming

This page was built for publication: Efficiency and generalised convexity in vector optimisation problems