Minmax linear programmes with grouped variables
From MaRDI portal
zbMATH Open0675.90051MaRDI QIDQ1122476FDOQ1122476
Authors: S. K. Gupta, Abraham P. Punnen
Publication date: 1989
Published in: Opsearch (Search for Journal in Brave)
Recommendations
- Minmax linear knapsack problem with grouped variables and gub
- Minimax resource allocation problems: Optimization and parametric analysis
- Parametric linear programming and cluster analysis
- An efficient algorithm for minimizing a multivariate polyhedral function along a line
- Minimax linear programming problem
Cited In (8)
- Traveling salesman problem under categorization
- Minmax linear knapsack problem with grouped variables and gub
- A mofified gub algorithm for solving linear minimax problems
- The stochastic bottleneck linear programming problem
- Title not available (Why is that?)
- Minimum perfect bipartite matchings and spanning trees under categorization
- On combined minmax-minsum optimization
- Title not available (Why is that?)
This page was built for publication: Minmax linear programmes with grouped variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122476)