Mixed binary interval goal programming

Mixed binary interval goal programming

0.00 Avg rating0 Votes
Article ID: iaor20072066
Country: United Kingdom
Volume: 57
Issue: 4
Start Page Number: 469
End Page Number: 473
Publication Date: Apr 2006
Journal: Journal of the Operational Research Society
Authors:
Keywords: programming: integer
Abstract:

This paper focuses on the mixed binary preferences decision problem associated with the use of penalty functions in goal programming. In this sense, a new formulation approach for interval goal programming is derived, which is more efficient than the model of Jones and Tamiz. In addition, to enhance the usefulness of the proposed model, binary variables subject to the environmental constraints are added. This leads to the model of binary interval goal programming. Finally, examples to illustrate these models are given.

Reviews

Required fields are marked *. Your email address will not be published.