Generating equidistant representations in biobjective programming
From MaRDI portal
Publication:429518
DOI10.1007/S10589-011-9403-5zbMath1244.90206OpenAlexW1966870942MaRDI QIDQ429518
Stacey L. Faulkenberg, Margaret M. Wiecek
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9403-5
convex conesefficient setcoveragenondominated setdiscrete representationsbiobjective programsspacing
Related Items (4)
Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Quadratic scalarization for decomposed multiobjective optimization ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the quality of discrete representations in multiple objective programming
- Multiobjective search algorithm with subdivision technique
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- An algorithm for optimizing over the weakly-efficient set
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- The structure of admissible points with respect to cone dominance
- Practical bilevel optimization. Algorithms and applications
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Reference point approximation method for the solution of bicriterial nonlinear optimization problems
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- Search for efficient solutions of multi-criteria problems by target-level method
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Scalarizing vector optimization problems
- Gap-free computation of Pareto-points by quadratic scalarizations
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Algorithm robust for the bicriteria discrete optimization problem
- Finding representative systems for discrete bicriterion optimization problems
- Approximation methods in multiobjective programming
- A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Diversity Maximization Approach for Multiobjective Optimization
- Introduction to the Theory of Nonlinear Optimization
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- An Adaptive Scalarization Method in Multiobjective Optimization
- A Constraint Method in Nonlinear Multi-Objective Optimization
- Solving multiobjective programming problems by discrete representation
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Relative importance of criteria: a quantitative approach
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
- On the Structure of the Non-dominated Set for Bicriteria Programmes
This page was built for publication: Generating equidistant representations in biobjective programming
