A lexicographic minimax algorithm for multiperiod resource allocation

DOI10.1007/BF01581200zbMath0766.90022MaRDI QIDQ1196169

Donald R. Smith, Hanan Luss, Rachelle S. Klein

Publication date: 17 December 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581200

zbMATH Keywords

minimax algorithm; largest weighted deviation; lexicographic procedure; multiperiod problem

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

91B62: Economic growth models

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

An algorithm for linearly-constrained piecewise lexicographic programming problems., On the lexicographic centre of multiple objective optimization, Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution, An equitable bandwidth allocation model for video-on-demand networks, Multiperiod allocation of substitutable resources, On the lexicographic minimax approach to location problems, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, Bounded knapsack sharing, A game-theoretic optimisation approach to fair customer allocation in oligopolies, Balanced flows for transshipment problems, Fair optimization and networks: a survey, A multicriteria facility location model for municipal solid waste management in North Greece, Equitable bandwidth allocation in content distribution networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Max-min resource allocation
• Solving knapsack sharing problems with general tradeoff functions
• A graphical method to solve a maximin allocation problem
• Resource allocation among competing activities: A lexicographic minimax approach
• An algorithm for separable nonlinear minimax problems
• An algorithm for solving linearly constrained minimax problems
• Continuous maximin knapsack problems with GLB constraints
• A Max-Min Allocation Problem: Its Solutions and Applications
• Linear max-min programming
• New algorithms for constrained minimax optimization
• Linearly constrained minimax optimization
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Allocation of Total Sample Size When Only the Stratum Means Are of Interest