An achievement rate approach to linear programming problems with an interval objective function

Journal of the Operational Research Society

Volumn 48, Issue 1, 1997, Pages 25-35

  Inuiguchi, M ^a   Sakawa, M ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Fractional programming; Fuzzy sets; Linear programming; Optimization

Indexed keywords

ALGORITHMS; FUNCTIONS; FUZZY SETS; MATRIX ALGEBRA; OPTIMIZATION;

FRACTIONAL PROGRAMMING; INTERVAL OBJECTIVE FUNCTION; MAXIMIN ACHIEVEMENT RATE SOLUTION;

LINEAR PROGRAMMING;

EID: 0030672687     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600322     Document Type: Article

References (14)

1. Bitran, G. R., (1980). Linear multiple objective problems withinterval coefficients, MgmtSci 26: 694-706.
2. Steuer, R. E., (1981). Algorithms for linear programmingproblems with interval objective function coefficients, MathOpns Res 6: 333-348.
3. Rommelfanger, H., Hanuscheck, R., Wolf, J., (1989). Linearprogramming with fuzzy objectives, Fuzzy Sets Systems29: 31-48.
4. Ishibuchi, H., Tanaka, H., (1990). Multiobjective programmingin optimization of the interval objective function, Eur JOpl Res 48: 219-225.
5. Inuiguchi, M., Kume, Y., (1991). Goal programming problemswith interval coefficients target intervals, Eur J Opl Res 52:345-360.
6. Inuiguchi, M., Kume, Y., (1992). Extensions of efficiency topossibilisticmultiobjective linear programming problems. InProceeding of the Tenth International Conference on MultipleCriteria Decision Making, Vol. 3, Taipei, pp. 331-340.
7. Inuiguchi, M., Kume, Y., (1994). Minimax regret in linearprogramming problems with an interval objective function. In Multiple Criteria Decision Making (Tzeng GH, Wang HF, Wen UP Yu PL, Eds.). Springer-Verlag: New York, pp.65-74.
8. Inuiguchi, M., Sakawa, M., (1994). Possible necessaryimality tests in possibilistic linear programming problems, Fuzzy Sets Systems 67: 29-46.
9. Dubois, D., Prade, H., (1988). Possibility Theory: AnApproach to Computerized Processing of Uncertainty.Plenum Press: New York.
10. Goldfarb, D., Todd, M. J., (1989). Linear Programming. InHandbooks in Operations Research Management Science:Vol. 1 Optimization (Nemhauser GL Rinnooy AHG, Eds.).North-Holland: Amsterdam, pp. 73-170.
11. Van de Panne, C., (1975). A node method for multiparametriclinear programming, MgmtSci 21: 1014-1020.
12. Yu, P. L., Zeleny, M., (1976). Linear multiparametric programmingby multicriteria simplex method, MgmtSci 23: 159-170.
13. Shimizu, K., Aiyoshi, E., (1980). Necessary conditions formin-max problems algorithms by a relaxation procedure, IEEE Trans. Automatic Control AC-25: 62-66.
14. Charnes, A., Cooper, W. W., (1962). Programming with linearfractional criteria, Naval Res Logist 9: 181-186.