Relaxation-based algorithms for minimax optimization problems with resource allocation applications
type: Item
instance of: scholarly article
title: Relaxation-based algorithms for minimax optimization problems with resource allocation applications
zbMATH Open document ID: 0805.90099
DOI: 10.1007/BF01582580
author: Rachelle S. Klein
author: Hanan Luss
author: Uriel G. Rothblum
published in: Mathematical Programming. Series A. Series B
publication date: 1995-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 636175
zbMATH Keywords: resource allocation
zbMATH Keywords: relaxation approach
zbMATH Keywords: minimax optimization
zbMATH Keywords: relaxation-based algorithms
zbMATH Keywords: simplex method
zbMATH Keywords: Farkas multipliers
zbMATH Keywords: knapsack type constraints
zbMATH Keywords: max-flow algorithm
MaRDI profile type: Publication
cites work: Minimax linear programming problem
cites work: An algorithm for solving linearly constrained minimax problems
cites work: The Knapsack Sharing Problem
cites work: The Linear Sharing Problem
cites work: Solving knapsack sharing problems with general tradeoff functions
cites work: Allocation of Total Sample Size When Only the Stratum Means Are of Interest
cites work: A graphical method to solve a maximin allocation problem
cites work: New algorithms for constrained minimax optimization
cites work: Continuous maximin knapsack problems with GLB constraints
cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
cites work: Q4286721
cites work: Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
cites work: Minimax Resource Allocation with Tree Structured Substitutable Resources
cites work: Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
cites work: A lexicographic minimax algorithm for multiperiod resource allocation
cites work: A linear-time algorithm for solving continuous maximin knapsack problems
cites work: A mofified gub algorithm for solving linear minimax problems
cites work: An algorithm for separable nonlinear minimax problems
cites work: A nonlinear minimax allocation problem with multiple knapsack constraints
cites work: Minimax resource allocation problems: Optimization and parametric analysis
cites work: Resource allocation among competing activities: A lexicographic minimax approach
cites work: Q3795498
cites work: Linearly constrained minimax optimization
cites work: Max-min resource allocation
cites work: Q4750414
cites work: Q4101610
cites work: A Multiperiod Minimax Resource Allocation Problem with Substitutable Resources
cites work: A min-max resource allocation problem with substitutions
cites work: Linear max-min programming
cites work: A Max-Min Allocation Problem: Its Solutions and Applications
cites work: Representation of general and polyhedral subsemilattices and sublattices of product spaces
full work available at URL: https://doi.org/10.1007/bf01582580
OpenAlex ID: W2071095524
description: scientific article; zbMATH DE number 636175