A min-max resource allocation problem with substitutions

DOI10.1016/0377-2217(89)90387-1zbMath0685.90082OpenAlexW2090604111MaRDI QIDQ1262219

Jong-Shi Pang, Chang-Sung Yu

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90387-1

zbMATH Keywords

resource allocationcomputational resultssubstitutionmin-max objectiveparametric transportation algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Existence of solutions for minimax problems (49J35)

Related Items (15)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ CMIT, capacitated multi-level implosion tool ⋮ Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ New upper bounds and exact methods for the knapsack sharing problem ⋮ Multiperiod allocation of substitutable resources ⋮ Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item ⋮ An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems ⋮ A best first search exact algorithm for the multiple-choice multidimensional knapsack problem ⋮ Minimax resource allocation problems: Optimization and parametric analysis ⋮ An exact algorithm for the knapsack sharing problem ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem ⋮ Min-max optimization of several classical discrete optimization problems ⋮ A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem ⋮ Fair optimization and networks: a survey

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resource allocation among competing activities: A lexicographic minimax approach
• An algorithm for separable nonlinear minimax problems
• An operator theory of parametric programming for the transportation problem-I
• Simple Ranking Methods for Allocation of One Resource
• Solution techniques for some allocation problems
• Technical Note—Allocation of Effort Resources among Competing Activities
• Allocation of Marketing Effort Among P Substitutional Products in N Territories^†

This page was built for publication: A min-max resource allocation problem with substitutions