\(\varepsilon\)-optimality and duality for multiobjective fractional programming

DOI10.1016/S0898-1221(99)00105-4zbMath0937.90097MaRDI QIDQ1806494

Jen-chwan Liu, Kazunori Yokoyama

Publication date: 8 November 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

penalty functions\(\varepsilon\)-parametric approach\(\varepsilon\)-Pareto optimality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (18)

\(\varepsilon\)-optimality for multiobjective programming on a Banach space ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ On approximate efficiency in multiobjective programming ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Existence and duality of generalized \(\epsilon\)-vector equilibrium problems ⋮ Unnamed Item ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ A class of nonsmooth fractional multiobjective optimization problems ⋮ A proposal to the solution of multiobjective linear fractional programming problem ⋮ Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems ⋮ Duality for \(\varepsilon \)-variational inequality ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ A sixth bibliography of fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• \(\epsilon\)-solutions in vector minimization problems
• \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
• \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
• \(\epsilon\)-formality and duality for fractional programming
• On the variational principle
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Exact penalty functions in nonlinear programming
• Necessary conditions for ε-optimality
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• A dual differentiable exact penalty function
• Necessary and sufficient conditions for a penalty method to be exact
• Parametric approaches to fractional programs
• Penalty functions in ε-programming and ε-minimax problems
• Sufficiency of Exact Penalty Minimization
• Non-Linear Programming Via Penalty Functions

This page was built for publication: \(\varepsilon\)-optimality and duality for multiobjective fractional programming