A mofified gub algorithm for solving linear minimax problems

DOI<311::AID-NAV3220360308>3.0.CO;2-L 10.1002/1520-6750(198906)36:3<311::AID-NAV3220360308>3.0.CO;2-LzbMath0679.90038OpenAlexW1990288108MaRDI QIDQ4729610

Kouji Mori, Takahito Kuno, Hiroshi Konno

Publication date: 1989

Full work available at URL: https://doi.org/10.1002/1520-6750(198906)36:3<311::aid-nav3220360308>3.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)

Related Items (5)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ Minimax resource allocation problems: Optimization and parametric analysis ⋮ Traveling salesman problem under categorization ⋮ Minmax linear knapsack problem with grouped variables and gub ⋮ A linear-time algorithm for solving continuous maximin knapsack problems

Cites Work

• Generalized upper bounding techniques

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