The balanced linear programming problem

DOI10.1016/S0377-2217(96)00142-7zbMath0929.90055OpenAlexW2075323586WikidataQ126323620 ScholiaQ126323620MaRDI QIDQ1278929

Ravindra K. Ahuja

Publication date: 18 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00142-7

zbMATH Keywords

minimax optimizationnetwork flow problemparametric simplex methodbalanced linear programming problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (7)

The balanced traveling salesman problem ⋮ Balanced Optimization with Vector Costs ⋮ Lexicographic balanced optimization problems ⋮ Robust balanced optimization ⋮ Balanced paths in acyclic networks: Tractable cases and related approaches ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ The quadratic balanced optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced optimization problems
• Minimax linear programming problem
• Most and least uniform spanning trees
• An algorithm for solving linearly constrained minimax problems
• Algorithms for the minimax transportation problem
• The Linear Sharing Problem
• FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME
• WEIGHTED MINIMAX REAL-VALUED FLOWS
• Linear max-min programming
• Optimal sharing
• New algorithms for constrained minimax optimization
• Linearly constrained minimax optimization
• A subgradient algorithm for certain minimax and minisum problems
• The Sharing Problem
• The Knapsack Sharing Problem
• The flow circulation sharing problem
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation

This page was built for publication: The balanced linear programming problem