An interactive algorithm for nonlinear vector optimization
From MaRDI portal
Publication:749445
DOI10.1007/BF01447324zbMATH Open0712.90061MaRDI QIDQ749445FDOQ749445
Authors: Siegfried Helbig
Publication date: 1990
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Recommendations
Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Convex Analysis
- Scalarizing vector optimization problems
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- The structure of admissible points with respect to cone dominance
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems
- Multi-objective optimization over convex disjunctive feasible sets using reference points
- The adaptive parameter control method and linear vector optimization
- Stepwise bayes rules
- Scalarizations for adaptively solving multi-objective optimization problems
- Title not available (Why is that?)
- The Pascoletti-Serafini scalarization scheme and linear vector optimization
- New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
- Title not available (Why is that?)
- Approximation of the efficient point set by perturbation of the ordering cone
- An algorithm for vector optimization problems
This page was built for publication: An interactive algorithm for nonlinear vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749445)