Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482808 | European Journal of Operational Research | 2006 | 9 Pages |
Abstract
The problem resulting from a goal programming problem with linear fractional criteria is not easy to solve due to the non-linear constraints inherent in its formulation. This paper introduces a simple and reliable test to establish whether a linear fractional goal programming problem has solutions that verify all goals and, if so, how to find them by solving a linear programming problem. This paper also outlines a new technique for restoring efficiency based on a minimax philosophy. An example is presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Rafael Caballero, Mónica Hernández,