Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem

HTML  XML Download Download as PDF (Size: 1944KB)  PP. 323-342  
DOI: 10.4236/ajor.2018.85019    849 Downloads   1,759 Views  

ABSTRACT

In case of mathematical programming problems with conflicting criteria, the Pareto set is a useful tool for a decision maker. Based on the geometric properties of the Pareto set for a bicriteria linear programming problem, we present a simple and fast method to compute this set in the criterion space using only an elementary linear program solver. We illustrate the method by solving the pig diet formulation problem which takes into account not only the cost of the diet but also nitrogen or phosphorus excretions.

Share and Cite:

Dubeau, F. and Habingabwa, M. (2018) Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem. American Journal of Operations Research, 8, 323-342. doi: 10.4236/ajor.2018.85019.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.