Primal-Dual Simplex Method for Multiobjective Linear Programming |
| |
Authors: | M. Ehrgott J. Puerto A. M. Rodríguez-Chía |
| |
Affiliation: | (1) Department of Engineering Science, University of Auckland, Auckland, New Zealand;(2) Departamento de Estadística e Investigación Operativa, Universidad de Sevilla, Sevilla, Spain;(3) Departamento de Estadística e Investigación Operativa, Universidad de Cádiz, Cádiz, Spain |
| |
Abstract: | We develop a primal-dual simplex algorithm for multicriteria linear programming. It is based on the scalarization theorem of Pareto optimal solutions of multicriteria linear programs and the single objective primal-dual simplex algorithm. We illustrate the algorithm by an example, present some numerical results, give some further details on special cases and point out future research. The paper was written during a visit of the first author to the University of Sevilla financed by a grant of the Andalusian Consejería de Educación. The research of the first author was partially supported by University of Auckland Grant 3602178/9275. The research of the second and third authors was partially financed by Spanish Grants BFM2001-2378, BFM2001-4028, MTM2004-0909 and HA2003-0121. We thank Anthony Przybylski for the implementation and making his results available. We thank the anonymous referees, whose comments have helped us to improve the presentation of the paper. |
| |
Keywords: | Multiobjective linear programming Primal-dual simplex algorithm |
本文献已被 SpringerLink 等数据库收录! |
|