Approximation methods in multiobjective programming
From MaRDI portal
Publication:2583199
DOI10.1007/s10957-005-5494-4zbMath1093.90057OpenAlexW2064823886WikidataQ30052812 ScholiaQ30052812MaRDI QIDQ2583199
Stefan Ruzika, Margaret M. Wiecek
Publication date: 13 January 2006
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-5494-4
Multi-objective and goal programming (90C29) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (73)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ On upper approximations of Pareto fronts ⋮ A combined scalarizing method for multiobjective programming problems ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization ⋮ An improved algorithm for solving biobjective integer programs ⋮ Scalarizations for adaptively solving multi-objective optimization problems ⋮ Inverse DEA with frontier changes for new product target setting ⋮ On finding representative non-dominated points for bi-objective integer network flow problems ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach ⋮ An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ On the quality of discrete representations in multiple objective programming ⋮ A Benson type algorithm for nonconvex multiobjective programming problems ⋮ The \(F\)-objective function method for differentiable interval-valued vector optimization problems ⋮ Numerical solution of an obstacle problem with interval coefficients ⋮ A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ NAUTILUS navigator: free search interactive multiobjective optimization without trading-off ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Constrained optimization for stratified treatment rules with multiple responses of survival data ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach ⋮ Generating equidistant representations in biobjective programming ⋮ Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization ⋮ The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives ⋮ On Pareto optimality conditions in the case of two-dimension non-convex utility space ⋮ Primal and dual approximation algorithms for convex vector optimization problems ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ Exact generation of epsilon-efficient solutions in multiple objective programming ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ A note on optimality conditions for multi-objective problems with a Euclidean cone of preferences ⋮ A simple method for approximating a general Pareto surface ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Covers and approximations in multiobjective optimization ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ Multi-objective branch and bound ⋮ City-courier routing and scheduling problems ⋮ Constructing a Pareto front approximation for decision making ⋮ Multiobjective bilevel optimization ⋮ PAINT: Pareto front interpolation for nonlinear multiobjective optimization ⋮ An approximation algorithm for convex multi-objective programming problems ⋮ Pareto navigator for interactive nonlinear multiobjective optimization ⋮ A mesh adaptive direct search algorithm for multiobjective optimization ⋮ Cooperative multiobjective optimization with bounds on objective functions ⋮ Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm ⋮ Approximating the nondominated set of an MOLP by approximately solving its dual problem ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems ⋮ Tracing Locally Pareto-Optimal Points by Numerical Integration ⋮ How Good is the Chord Algorithm? ⋮ An approximation to the nondominated set of a multiobjective linear fractional programming problem ⋮ Comments on: ``Static and dynamic source locations in undirected networks ⋮ A Constraint Method in Nonlinear Multi-Objective Optimization ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ New multi-objective method to solve reentrant hybrid flow shop scheduling problem ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem ⋮ Methods for Multiobjective Bilevel Optimization ⋮ \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- The normalized normal constraint method for generating the Pareto frontier
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- A method for convex curve approximation
- Approximating the noninferior set in multiobjective linear programming problems
- Reference point approximation method for the solution of bicriterial nonlinear optimization problems
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- Efficient approximate representation of bi-objective tradeoff sets
- Search for efficient solutions of multi-criteria problems by target-level method
- Minimum effort approximation of the Pareto space of convex bi-criteria problems
- Norm-based approximation in multicriteria programming.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A comparison of two reference point methods in multiple objective mathematical programming.
- Computational study of the relationships between feasible and efficient sets and an approximation
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Generating well-distributed sets of Pareto points for engineering design using physical programming
- Piecewise quadratic approximation of the non-dominated set for bi-criteria programs
- An approximation method for the efficiency set of multiobjective programming problems
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- On the approximation of a pareto set
- Approximation of a set of Pareto-optimal solutions
- Solving multiobjective programming problems by discrete representation
- An interactive rectangle elimination method for biobjective decision making
- An algorithm for bicriteria optimization based on the sensitivity function
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Approximation of Value Efficient Solutions
- Approximation of the efficient point set by perturbation of the ordering cone
- Norm-based approximation in bicriteria programming
This page was built for publication: Approximation methods in multiobjective programming
