Proper efficiency in vector infinite programming problems

DOI10.1007/s11590-008-0111-8zbMath1170.90472OpenAlexW1988771364MaRDI QIDQ839793

Valeriano Antunes de Oliveira, Marko A. Rojas-Medar

Publication date: 3 September 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/142721

zbMATH Keywords

invexityproperly efficient solutionsmulti-objective problemsinfinite programming problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items

Relaxation methods for solving linear inequality systems: converging results ⋮ Optimality conditions for nonlinear infinite programming problems ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ Vector continuous-time programming without differentiability ⋮ Efficiency for a generalized form of vector optimization problems in complex space

Cites Work

• Unnamed Item
• Unnamed Item
• Nonasymptotic necessary conditions for nonsmooth infinite optimization problems
• Multi-objective infinite programming
• Proper efficiency and the theory of vector maximization
• A unified theory of first and second order conditions for extremum problems in topological vector spaces
• First Order Conditions for General Nonlinear Optimization
• An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
• Nonlinear Programming in Banach Space
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space

This page was built for publication: Proper efficiency in vector infinite programming problems