Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A min-max problem as a linear programming problem

From MaRDI portal
Publication:1163473
Jump to:navigation, search

zbMath0483.90063MaRDI QIDQ1163473

S. K. Gupta, Ashok Kumar Mittal

Publication date: 1982

Published in: Opsearch (Search for Journal in Brave)


zbMATH Keywords

min-max problembottleneck transportation problembottleneck assignment


Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)


Related Items (5)

Minimum deviation problems ⋮ On ranking of feasible solutions of a bottleneck linear programming problem ⋮ A bilevel bottleneck programming problem ⋮ Bottleneck flows in unit capacity networks ⋮ The stochastic bottleneck linear programming problem




This page was built for publication: A min-max problem as a linear programming problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1163473&oldid=13233463"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki