Bicriteria bottleneck linear programming problem

DOI10.1080/02331939308843911zbMath0818.90100OpenAlexW2071242820MaRDI QIDQ3835630

Kanchan Mathur, Sushma Bansal, Munish C. Puri

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939308843911

zbMATH Keywords

convergent algorithmnon-convex programmingconcave bottleneck functionsbicriteria bottleneck linear programmingefficient pairs

Mathematics Subject Classification ID

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

Related Items (1)

The stochastic bottleneck linear programming problem

Cites Work

• Unnamed Item
• Time-cost tradeoff in a three-dimensional assignment problem
• An algorithm for bicriterion linear programming
• Bicriteria Transportation Problem
• A min max problem
• Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
• Solving Bicriterion Mathematical Programs
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• The bottleneck transportation problem

This page was built for publication: Bicriteria bottleneck linear programming problem