Lexicographically Minimum and Maximum Load Linear Programming Problems

DOI10.1287/opre.1060.0341zbMath1167.90400OpenAlexW2086375379WikidataQ59592427 ScholiaQ59592427MaRDI QIDQ3392067

James B. Orlin, Dritan Nace

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1060.0341

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (12)

Planning sustainable routes: economic, environmental and welfare concerns ⋮ Inequity averse optimization in operational research ⋮ Max-min fairness in multi-commodity flows ⋮ Proportional and maxmin fairness for the sensor location problem with chance constraints ⋮ Portioning using ordinal preferences: fairness and efficiency ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ Balanced flows for transshipment problems ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing ⋮ An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems ⋮ Editorial. Fair optimization and networks: models, algorithms, and applications ⋮ Fair optimization and networks: a survey

This page was built for publication: Lexicographically Minimum and Maximum Load Linear Programming Problems