View article

In conventional goal programming, the coefficients of objective functions and constraints, and target values are determined as crisp values. However, it is not frequent that the coefficients and the target values are known precisely. In such cases, the coefficients and target values should be represented by intervals reflecting the imprecision. This paper treats goal programming problems in which coefficients and target values are given the intervals. It is shown that four formulations of the problems can be considered. The properties of the four formulated problems are investigated. An example is given to demonstrate the differences between the four formulations.