-optimality and duality for multiobjective fractional programming
From MaRDI portal
Publication:1806494
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
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- A dual differentiable exact penalty function
- Exact penalty functions in nonlinear programming
- Necessary and sufficient conditions for a penalty method to be exact
- Necessary conditions for ε-optimality
- Non-Linear Programming Via Penalty Functions
- On the variational principle
- Parametric approaches to fractional programs
- Penalty functions in ε-programming and ε-minimax problems
- Sufficiency of Exact Penalty Minimization
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-formality and duality for fractional programming
- \(\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
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
Cited in
(21)- A sixth bibliography of fractional programming
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- 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
- On approximate efficiency in multiobjective programming
- Duality for \(\varepsilon \)-variational inequality
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Existence and duality of generalized \(\epsilon\)-vector equilibrium problems
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Optimality and duality for a weakly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
- \(\varepsilon\)-optimality for minimax programming problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- scientific article; zbMATH DE number 4152161 (Why is no real title available?)
- On approximating weakly/properly efficient solutions in multi-objective programming
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- A class of nonsmooth fractional multiobjective optimization problems
- On approximate solutions in vector optimization problems via scalarization
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)
