-optimality and duality for multiobjective fractional programming

DOI10.1016/S0898-1221(99)00105-4zbMATH Open0937.90097MaRDI QIDQ1806494FDOQ1806494

Authors: Jen-chwan Liu, Kazunori Yokoyama 

Publication date: 8 November 1999

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

Recommendations

• \(\epsilon\)-formality and duality for fractional programming
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• Publication:3481503
• On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
• Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806494)