On a min-max problem

MaRDI QIDQ798562zbMATH OpenFDO

Authors Mustafa Akgül

Publication date 1984

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

assignmentrational polyhedramin-max problemsolution techniquebottleneck transportationlexicographic linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Polytopes and polyhedra (52Bxx) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 4136844
• scientific article; zbMATH DE number 4103825
• scientific article; zbMATH DE number 3173779
• scientific article; zbMATH DE number 3923028
• Su un problema di minimax discreto
• scientific article; zbMATH DE number 3901511
• On a minmax theorem
• Minimum and maximum problems

Cited in

(7)

• scientific article; zbMATH DE number 2221947 (Why is no real title available?)
• The stochastic bottleneck linear programming problem
• scientific article; zbMATH DE number 3923028 (Why is no real title available?)
• scientific article; zbMATH DE number 3882492 (Why is no real title available?)
• K-Sum Linear Programming
• A bilevel bottleneck programming problem
• The directions of decrease for minmaxmin problems

This page was built for publication: On a min-max problem

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