Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Minmax linear programmes with grouped variables

From MaRDI portal
Jump to:navigation, search

zbMATH Open0675.90051MaRDI QIDQ1122476FDOQ1122476


Authors: S. K. Gupta, Abraham P. Punnen Edit this on Wikidata


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


zbMATH Keywords

linear constraintsgrouped variablesparametric analysisminmax linear programmes


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1122476&oldid=13168311"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 02:57. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki