Approximation methods in multiobjective programming
From MaRDI portal
Publication:2583199
Recommendations
Cites work
- -optimality for bicriteria programs and its application to minimum cost flows
- A comparison of two reference point methods in multiple objective mathematical programming.
- A method for convex curve approximation
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- An algorithm for bicriteria optimization based on the sensitivity function
- An approximation method for the efficiency set of multiobjective programming problems
- An interactive rectangle elimination method for biobjective decision making
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
- Approximating the noninferior set in multiobjective linear programming problems
- Approximation of a set of Pareto-optimal solutions
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Approximation of the efficient point set by perturbation of the ordering cone
- Approximation of Value Efficient Solutions
- Computational study of the relationships between feasible and efficient sets and an approximation
- Efficient approximate representation of bi-objective tradeoff sets
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Generating well-distributed sets of Pareto points for engineering design using physical programming
- scientific article; zbMATH DE number 1830716 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Minimum effort approximation of the Pareto space of convex bi-criteria problems
- Norm-based approximation in bicriteria programming
- Norm-based approximation in multicriteria programming.
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- On the approximation of a pareto set
- Piecewise quadratic approximation of the non-dominated set for bi-criteria programs
- Reference point approximation method for the solution of bicriterial nonlinear optimization problems
- Search for efficient solutions of multi-criteria problems by target-level method
- Solving multiobjective programming problems by discrete representation
- The normalized normal constraint method for generating the Pareto frontier
- Towards finding global representations of the efficient set in multiple objective mathematical programming
Cited in
(only showing first 100 items - show all)- Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- Unified approach to approximate solutions in games and multiobjective programming
- Approximation in multiobjective optimization
- Approximating the noninferior set in multiobjective linear programming problems
- Convergence estimates for crude approximations of a Pareto set.
- Norm-based approximation in multicriteria programming.
- On upper approximations of Pareto fronts
- Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Interactive \textsc{Nonconvex Pareto Navigator} for 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
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Computational study of the relationships between feasible and efficient sets and an approximation
- Cooperative multiobjective optimization with bounds on objective functions
- A general branch-and-bound framework for continuous global multiobjective optimization
- Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- A norm minimization-based convex vector optimization algorithm
- Numerical solution of an obstacle problem with interval coefficients
- City-courier routing and scheduling problems
- Pareto navigator for interactive nonlinear multiobjective optimization
- A mesh adaptive direct search algorithm for multiobjective optimization
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
- Random approximations in multiobjective optimization
- A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization
- An improved algorithm for solving biobjective integer programs
- An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making
- A Benson type algorithm for nonconvex multiobjective programming problems
- NAUTILUS navigator: free search interactive multiobjective optimization without trading-off
- On Pareto optimality conditions in the case of two-dimension non-convex utility space
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Finding representative systems for discrete bicriterion optimization problems
- Cone characterizations of approximate solutions in real vector optimization
- The \(F\)-objective function method for differentiable interval-valued vector optimization problems
- A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem
- On the approximation of unbounded convex sets by polyhedra
- Approximate separable multichoice optimization over monotone systems
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- How good is the Chord algorithm?
- An approximation to the nondominated set of a multiobjective linear fractional programming problem
- Solving generalized convex multiobjective programming problems by a normal direction method
- Applications of discrepancy theory in multiobjective approximation
- Computing the set of approximate solutions of a multi-objective optimization problem by means of cell mapping techniques
- A combined scalarizing method for multiobjective programming problems
- A simple method for approximating a general Pareto surface
- An approximation method for the efficiency set of multiobjective programming problems
- Inverse DEA with frontier changes for new product target setting
- On finding representative non-dominated points for bi-objective integer network flow problems
- Tracing locally Pareto-optimal points by numerical integration
- Representation of the non-dominated set in biobjective discrete optimization
- Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
- A method of approximating Pareto sets for assessments of implicit Pareto set elements
- Approximability and Hardness in Multi-objective Optimization
- A constraint method in nonlinear multi-objective optimization
- scientific article; zbMATH DE number 3910156 (Why is no real title available?)
- scientific article; zbMATH DE number 3932807 (Why is no real title available?)
- scientific article; zbMATH DE number 3948016 (Why is no real title available?)
- On the quality of discrete representations in multiple objective programming
- Approximate solution of multicriterion problems with functional limitations
- scientific article; zbMATH DE number 4066640 (Why is no real title available?)
- Generating equidistant representations in biobjective programming
- scientific article; zbMATH DE number 1160625 (Why is no real title available?)
- Primal and dual approximation algorithms for convex vector optimization problems
- A note on optimality conditions for multi-objective problems with a Euclidean cone of preferences
- Inner approximation algorithm for solving linear multiobjective optimization problems
- Methods for Multiobjective Bilevel Optimization
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- Covers and approximations in multiobjective optimization
- Approximations of bi-criteria optimization problem
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- Constructing a Pareto front approximation for decision making
- An approximation algorithm for convex multi-objective programming problems
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Comments on: ``Static and dynamic source locations in undirected networks
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- 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
- Verified methods for computing Pareto sets: general algorithmic analysis
- The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives
- A linearized approach for solving differentiable vector optimization problems with vanishing constraints
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- Column generation based solution for bi-objective gate assignment problems
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- An approximation algorithm for multiobjective mixed-integer convex optimization
- Deep learning the efficient frontier of convex vector optimization problems
- On necessary optimality conditions for sets of points in multiobjective optimization
This page was built for publication: Approximation methods in multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583199)
