Mixed binary interval goal programming

Ching Ter Chang*

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

11 Scopus citations

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.

Original languageEnglish
Pages (from-to)469-473
Number of pages5
JournalJournal of the Operational Research Society
Volume57
Issue number4
DOIs
StatePublished - 04 2006
Externally publishedYes

Keywords

  • Binary
  • Goal programming
  • Interval goal programming
  • Linearization

Fingerprint

Dive into the research topics of 'Mixed binary interval goal programming'. Together they form a unique fingerprint.

Cite this