Bicriteria bottleneck linear programming problem

DOI10.1080/02331939308843911MaRDI QIDQ3835630zbMATH OpenOpenAlexFDO

Authors 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

bicriteria bottleneck linear programmingconcave bottleneck functionsconvergent algorithmefficient pairsnon-convex programming

Mathematics Subject Classification ID

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

Recommendations

• On ranking of feasible solutions of a bottleneck linear programming problem
• A bilevel linear programming problem with bottleneck objectives
• A bilevel bottleneck programming problem
• A note on solving bicriteria linear programming problems using single criteria software
• The multiobjective bottleneck transportation problem.

Cites work

• A min max problem
• An algorithm for bicriterion linear programming
• Bicriteria Transportation Problem
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Solving Bicriterion Mathematical Programs
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
• The bottleneck transportation problem
• Time-cost tradeoff in a three-dimensional assignment problem

Cited in

(4)

• A note on solving bicriteria linear programming problems using single criteria software
• The stochastic bottleneck linear programming problem
• On ranking of feasible solutions of a bottleneck linear programming problem
• A sequential method for a class of bicriteria problems

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

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