A mofified gub algorithm for solving linear minimax problems

DOI10.1002/1520-6750(198906)36:3%3C311::AID-NAV3220360308%3E3.0.CO;2-LMaRDI QIDQ4729610zbMATH OpenOpenAlexFDO

Authors Takahito Kuno, Kouji Mori, Hiroshi Konno

Publication date 1989

Full work available at URL https://doi.org/10.1002/1520-6750(198906)36:3%3C311::aid-nav3220360308%3E3.0.co;2-l

zbMATH Keywords

computational experienceslinear minimax problemrevised simplex type method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Existence of solutions for minimax problems (49J35)

Recommendations

• Minimax linear programming problem
• An algorithm for solving linearly constrained minimax problems
• Resource allocation among competing activities: A lexicographic minimax approach
• An efficient algorithm for minimizing a multivariate polyhedral function along a line
• Minmax linear programmes with grouped variables

Cites work

• Generalized upper bounding techniques

Cited in

(7)

• Traveling salesman problem under categorization
• A linear-time algorithm for solving continuous maximin knapsack problems
• Minmax linear knapsack problem with grouped variables and gub
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• Minimax linear programming problem
• Minimax resource allocation problems: Optimization and parametric analysis
• REMARKS ON THE ASCENT ALGORITHM FOR THE LINEAR MINIMAX PROBLEM

This page was built for publication: A mofified gub algorithm for solving linear minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729610)