Linear programming with multiple fuzzy goals. (English) Zbl 0465.90080


90C31 Sensitivity, stability, parametric optimization
03E72 Theory of fuzzy sets, etc.
90C05 Linear programming
Full Text: DOI


[1] Bellman, R. E.; Zedah, L. A., Decision making in a fuzzy environment, Management Sci., 17, 141-164 (1970)
[2] Charnes, A.; Cooper, W. W., Management Models and Industrial Applications of Linear Programming (1961), John Wiley: John Wiley New York · Zbl 0107.37004
[3] Charnes, A.; Cooper, W. W., Goal programming and multiple objective optimizations, European J. Operational Res., 1, 39-54 (1977) · Zbl 0375.90079
[4] Dyer, J. S., Interactive goal programming, Management Sci., 19 (1972) · Zbl 0257.90023
[5] Dyer, J. S., An empirical investigation of a man-machine interactive approach to the solution of the multiple criteria problem, (Cochrane, J. L.; Zeleny, M., Multiple Criteria Decision Making (1973), University of South Carolina Press)
[6] Ecker, J. G.; Kouada, I. A., Finding efficient points for linear multiple objective programs, Math. Programming, 8, 375-377 (1975) · Zbl 0385.90105
[7] Evans, J. P.; Steuer, R. E., A revised simplex method for linear multiple objective programs, Math. Programing, 5, 54-72 (1973) · Zbl 0281.90045
[8] Evans, J. P.; Steuer, R. E., Generating efficient extreme points in linear multiple objective programming: Two algorithms and computing experience, (Cochrane, J. L.; Zeleny, M., Multiple Criteria Decision Making (1973), University of South Carolina Press) · Zbl 0281.90045
[9] Geoffrion, A. M.; Dyer, J. S.; Feinberg, A., An interactive approach for multi-criteria optimization, with an application to the operation of an academic department, Management Sci., 19, 357-368 (1972) · Zbl 0247.90069
[10] Hannan, E. L., Nondomiance in goal programming, INFOR, 18, 300-309 (1980) · Zbl 0449.90088
[11] Ignizio, J. P., Goal Programming and Extensions (1976), Heath: Heath Lexington, MA · Zbl 1052.90584
[12] Kornbluth, J. S.H., A survey of goal programming, Omega, 1, 193-205 (1973)
[13] Lee, S. M., Goal Programming for Decision Analysis (1972), Auerbach: Auerbach Philadelphia, PA
[14] Negoita, C. V.; Ralescu, D. A., On fuzzy optimization, Kybernetes, 6, 193-195 (1977) · Zbl 0378.90101
[15] Negoita, C. V.; Sularia, M., On fuzzy programming and tolerances in planning, Econom. Comp. Econom. Cybernet. Stud. Res., 1, 3-15 (1976) · Zbl 0336.90060
[16] Shanno, D. F.; Weil, R. L., ‘Linear’ programming with absolute-value functionals, Operations Research, 19, 120-124 (1971) · Zbl 0217.27201
[17] Sularia, M., On fuzzy programming in planning, Kybernetes, 6, 229-230 (1977)
[18] Thole, U.; Zimmerman, H. J.; Zysno, P., On the suitability of minimum and product operators for the intersection of fuzzy sets, Fuzzy Sets and Systems, 2, 167-180 (1979) · Zbl 0408.94030
[19] Wallenius, J., Comparative evaluation of some interactive approaches to multicriteria optimization, Management Sci., 21, 1387-1396 (1975) · Zbl 0307.90084
[20] Yager, R.; Basson, D., Decision making with fuzzy sets, Decision Sciences, 6 (1975)
[21] Yu, P. L.; Zeleny, M., The sets of all nondominated solutions in linear cases and a multicriteria simplex method, J. Math. Anal. Appl., 49, 430-468 (1975) · Zbl 0313.65047
[22] Zadeh, L. A., Fuzzy sets, Information and Control, 338-353 (1965) · Zbl 0139.24606
[23] Zeleny, M., Compromise Programming, (Cochrane, J. L.; Zeleny, M., Multiple Criteria Decision Making (1973), University of South Carolina Press) · Zbl 0325.90033
[24] Zimmermann, H.-J., Fuzzy programming and linear programming with several objective functions, Fuzzy Sets and Systems, 1, 45-55 (1978) · Zbl 0364.90065
[25] Zionts, S.; Wallenius, J., An interactive programming method for solving the multiple criteria problem, Management Sci., 22, 652-663 (1976) · Zbl 0318.90053
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.