Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
From MaRDI portal
Publication:2442076
DOI10.1007/s10479-012-1190-6zbMath1284.90073OpenAlexW2070847431MaRDI QIDQ2442076
Publication date: 31 March 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1190-6
relaxationmultiobjective optimizationscalarizationinteractive multiobjective optimizationpolyhedral outer approximationefficient (Pareto-optimal) solutions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A visual interactive method for solving the multiple criteria problem
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Partitioning procedures for solving mixed-variables programming problems
- Proper efficiency with respect to cones
- Interactive multiobjective decision making by the sequential proxy optimization technique: SPOT
- An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors
- Solving mixed integer nonlinear programs by outer approximation
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- On scalarizing functions in multiobjective optimization
- Multiple criteria decision analysis. State of the art surveys
- Integer programming duality in multiple objective programming
- Preface. Multiobjective discrete and combinatorial optimization (MODCO)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- An efficient sampling approach to multiobjective optimization
- Portfolio selection with divisible and indivisible assets: mathematical algorithm and economic analysis
- Generalized Benders decomposition
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Equivalent Information for Multiobjective Interactive Procedures
- A Survey of Multiple Criteria Integer Programming Methods
- Accelerating Benders method using covering cut bundle generation
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Solving multiple criteria problems by interactive decomposition
- An interactive approach to multiple criteria optimization with multiple decision-makers
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Multiple Objective Linear Programming with Interval Criterion Weights
- A Tradeoff Cut Approach to Multiple Objective Optimization
- Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- Objective function approximations in mathematical programming
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
- Unified Interactive Multiple Objective Programming: An Open Architecture For Accommodating New Procedures
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Extension of the generalized benders' decomposition
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Convex Analysis
- Linear programming with multiple objective functions: Step method (stem)
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- A Time-Sharing Computer Program for the Solution of the Multiple Criteria Problem
