.png){kind=icon}
Return
GOAL PROGRAMMING-PROBLEMS WITH INTERVAL-COEFFICIENTS AND TARGET INTERVALS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(91)90169-V.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 by 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.
Keywords:
INTERVAL PROGRAMMING
GOAL PROGRAMMING
OPTIMIZATION
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave no more
no more