Mixed binary interval goal programming

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...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of the Operational Research Society Vol. 57; no. 4; pp. 469 - 473
Main Author Chang, Ching-Ter
Format Journal Article
LanguageEnglish
Published Basingstoke Taylor & Francis 01.04.2006
Palgrave Macmillan Press
Palgrave
Taylor & Francis Ltd
Subjects
Applied sciences
binary
Continuous variables
Decision making
Decision making models
Exact sciences and technology
Goal programming
interval goal programming
linearization
Musical intervals
Operational research. Management science
Operations research
Optimal solutions
Penalty function
Studies
Technical Note
Penalty function
Mixed programming
Preference
interval goal programming
binary
Mixed problem
Linearization
Goal programming
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0160-5682
1476-9360
DOI:10.1057/palgrave.jors.2601999