A note on solving bicriteria linear programming problems using single criteria software

DOI10.1016/0305-0548(92)90090-RzbMATH Open0745.90047WikidataQ111900690 ScholiaQ111900690MaRDI QIDQ1186007FDOQ1186007

Authors: Srinivas Y. Prasad, Mark H. Karwan 

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4049388
• Three algorithms for bicriteria integer linear programs
• An algorithm for generating the efficient outcome set in bi-criteria linear programming problems and applications
• An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
• Bicriteria bottleneck linear programming problem

zbMATH Keywords

bicriteria linear programmingefficient extreme points

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Programming with linear fractional functionals
• A revised simplex method for linear multiple objective programs
• Bicriteria Transportation Problem
• An algorithm for bicriterion linear programming
• Title not available (Why is that?)
• Programming with linear fractional functionals

Cited In (3)

• Title not available (Why is that?)
• An algorithm for generating the efficient outcome set in bi-criteria linear programming problems and applications
• Bicriteria bottleneck linear programming problem

This page was built for publication: A note on solving bicriteria linear programming problems using single criteria software

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