A graphical method to solve a maximin allocation problem

DOI10.1016/0377-2217(86)90187-6zbMath0597.90080OpenAlexW1996709978MaRDI QIDQ1079506

Waldemar Czuchra

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90187-6

zbMATH Keywords

resource allocationgraphical methodmaximin allocation problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (9)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ An algorithm for separable nonlinear minimax problems ⋮ A graphical bicriteria approach to the resource allocation problem ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ A lexicographic minimax algorithm for multiperiod resource allocation ⋮ Minimax resource allocation problems: Optimization and parametric analysis ⋮ Minmax linear knapsack problem with grouped variables and gub ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Solving knapsack sharing problems with general tradeoff functions

Cites Work

• Max-min resource allocation
• A graphical method to solve a family of allocation problems
• Simple Ranking Methods for Allocation of One Resource
• The Knapsack Sharing Problem

This page was built for publication: A graphical method to solve a maximin allocation problem