Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
From MaRDI portal
Publication:953293
DOI10.1007/s00186-008-0220-2zbMath1211.90217OpenAlexW2048227807MaRDI QIDQ953293
Publication date: 17 November 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0220-2
multiobjective linear programmingradiotherapy treatment planning\({\varepsilon}\)-efficient solution
Related Items
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems, Strongly proper efficient solutions: efficient solutions with bounded trade-offs, A Benson-type algorithm for bounded convex vector optimization problems with vertex selection, A deterministic algorithm for global multi-objective optimization, Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy, A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems, A Benson type algorithm for nonconvex multiobjective programming problems, Objective Selection for Cancer Treatment: An Inverse Optimization Approach, Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems, A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming, Primal and dual approximation algorithms for convex vector optimization problems, Multi-criteria optimization and decision-making in radiotherapy, Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming, Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes, Discrete representation of non-dominated sets in multi-objective linear programming, Mathematical optimization in intensity modulated radiation therapy, Mathematical optimization in intensity modulated radiation therapy, The vector linear program solver Bensolve -- notes on theoretical background, A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs, An algorithm to solve polyhedral convex set optimization problems, A parametric simplex algorithm for linear vector optimization problems, Tractability of convex vector optimization problems in the sense of polyhedral approximations, An approximation algorithm for convex multi-objective programming problems, Approximating the nondominated set of an MOLP by approximately solving its dual problem, Benson type algorithms for linear vector optimization and applications, An extension of the non-inferior set estimation algorithm for many objectives, Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization, Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The normalized normal constraint method for generating the Pareto frontier
- Bound sets for biobjective combinatorial optimization problems
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On-line and off-line vertex enumeration by adjacency lists
- Hybrid approach for solving multiple-objective linear programs in outcome space
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Inverse radiation therapy planning -- a multiple objective optimization approach
- Intensity-modulated radiotherapy -- a large scale multi-criteria programming problem
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Convex Analysis
