Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems

DOI10.1007/978-3-319-23114-3_19MaRDI QIDQ3449541zbMATH OpenOpenAlexFDO

Authors Lucie Galand, Thibaut Lust

Publication date 4 November 2015

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL https://hal.sorbonne-universite.fr/hal-01361196/file/paper_ADTLorenz.pdf

zbMATH Keywords

fairnessLorenz dominancemultiobjective combinatorial optimizationtwo-phase method

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• An exact algorithm for biobjective integer programming problems
• Computing all sparse kinetic structures for a Lorenz system using optimization
• An exact algorithm for biobjective mixed integer linear programming problems
• Lorenz dominance based algorithms to solve a practical multiobjective problem
• Optimal parametric iteration method for solving multispecies Lotka-Volterra equations
• On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming
• scientific article; zbMATH DE number 3891128
• Numerical certification of Pareto optimality for biobjective nonlinear problems
• Exact Solutions for Minimax Optimization Problems
• Lagrangian approaches for a class of matching problems in computational biology

Cited in

(4)

• Lorenz dominance based algorithms to solve a practical multiobjective problem
• Generalized nash fairness solutions for bi‐objective minimization problems
• Fifty years of multi-objective optimization and decision-making: from mathematical programming to evolutionary computation
• Optimizing a linear function over the Lorenz-efficient set of multi-objective combinatorial optimization problems

This page was built for publication: Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449541)