On ranking of feasible solutions of a bottleneck linear programming problem

DOI10.1007/BF02568589zbMath0852.90108OpenAlexW2037361352MaRDI QIDQ1919119

Sushma Bansal, Munish C. Puri, Kanchan Mathur

Publication date: 1 August 1996

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568589

zbMATH Keywords

non-convex programmingmin-maxextreme-point rankingbottleneck linear programmingranking of the feasible solutions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Linear programming (90C05)

Related Items (1)

The stochastic bottleneck linear programming problem

Cites Work

• A transportation problem with objectives to minimize total cost and duration of transportation
• A min-max problem as a linear programming problem
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• A min max problem
• Bottleneck Linear Programming
• Time minimizing solid transportation problem
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Time‐minimizing transportation problems
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• The bottleneck transportation problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On ranking of feasible solutions of a bottleneck linear programming problem