A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
From MaRDI portal
Publication:3563914
DOI10.1137/080729013zbMath1191.90060OpenAlexW2005596987WikidataQ29031183 ScholiaQ29031183MaRDI QIDQ3563914
Daniel Mueller-Gritschneder, Ulf Schlichtmann, Helmut Graeb
Publication date: 1 June 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080729013
Related Items
Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality, Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems, Optimizing Network Topology for Cascade Resilience, Robust gradient-based multiobjective optimization for the generation of well controls to maximize the net-present-value of production under geological uncertainty, Efficient algorithms for solving nonlinear fractional programming problems, A modified NBI and NC method for the solution of \(N\)-multiobjective optimization problems, On improving normal boundary intersection method for generation of Pareto frontier, Stock portfolio selection using aspiration level-oriented procedure: real case on the RM-SYSTEM Czech stock exchange, A new approach to approximate the bounded Pareto front, Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems, Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem, An adaptive multipoint formulation for robust parametric optimization, On the hierarchical structure of Pareto critical sets, A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems, A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets, Multi-objective optimization using statistical models, A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization, Discrete representation of non-dominated sets in multi-objective linear programming, A new scalarization method for finding the efficient frontier in non-convex multi-objective problems, Pareto optimization of analog circuits considering variability, Topology of Pareto Sets of Strongly Convex Problems, A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems, Efficient scalarization in multiobjective optimal control of a nonsmooth PDE, A New Scalarization Technique and New Algorithms to Generate Pareto Fronts, Multi-phase algorithm design for accurate and efficient model fitting
