-properly efficient solutions to nondifferentiable multiobjective programming problems
From MaRDI portal
Publication:1808441
DOI10.1016/S0893-9659(99)00087-7zbMATH Open0944.90081MaRDI QIDQ1808441FDOQ1808441
Authors: Jen-chwan Liu 
Publication date: 26 September 2000
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Recommendations
Multi-objective and goal programming (90C29) Fréchet and Gateaux differentiability in optimization (49J50)
Cites Work
- Epsilon approximate solutions for multiobjective programming problems
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- Proper efficiency and the theory of vector maximization
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Systems of Inequalities Involving Convex Functions
Cited In (31)
- Epsilon-solutions and epsilon-supports
- Generalized KT-properly efficient solution of multiobjective programming in normed linear space
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization
- On a practical notion of geoffrion proper optimality in multicriteria optimization
- A combined scalarizing method for multiobjective programming problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Properly efficient solutions to non-differentiable multiobjective optimization problems
- \(E\)-Benson proper efficiency in vector optimization
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Characterizing ϵ-properly efficient solutions
- On approximate solutions in vector optimization problems via scalarization
- Approximate quasi solutions of multiobjective optimization problems
- On approximate efficiency in multiobjective programming
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Title not available (Why is that?)
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- Approximations for Pareto and proper Pareto solutions and their KKT conditions
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- A note on approximate proper efficiency in linear fractional vector optimization
- Improving the min-max method for multiobjective programming
- \(\varPhi\)-strict local efficient solution for multiobjective programming problems
- Approximate proper efficiency in vector optimization
- \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem
This page was built for publication: \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808441)
