Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem
| Autor: | M. E. Ntigura Habingabwa, F. Dubeau |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
021103 operations research Linear programming Computer science Quantitative Biology::Tissues and Organs Computation 0211 other engineering and technologies General Engineering Pareto principle 02 engineering and technology Solver Decision maker Space (mathematics) Set (abstract data type) Simple (abstract algebra) |
| Zdroj: | American Journal of Operations Research. :323-342 |
| ISSN: | 2160-8849 2160-8830 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|