Interior point multiobjective programming approach for production planning with uncertain information

Computers and Industrial Engineering

Volumn 37, Issue 3, 1999, Pages 631-648

  Trafalis, Theodore B ^a   Mishina, Tsutomu ^a   Foote, Bobbie L ^a  

^a UNIVERSITY OF OKLAHOMA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; INTERACTIVE COMPUTER SYSTEMS; RANDOM PROCESSES; STRATEGIC PLANNING;

INTERACTIVE MULTIOBJECTIVE PROGRAMMING APPROACH; INTERIOR POINT METHODS; PRODUCTION PLANNING;

OPERATIONS RESEARCH;

EID: 0033329390     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(00)00024-3     Document Type: Article

References (19)

1. Dantzig G.B. Linear programming under uncertainty. Management Science. 1:(3,4):1955;197-206.
2. Lasdon L.S. Optimization theory for large systems. 1970;Macmillan, New York.
3. Fiacco A.V. Introduction to sensitivity and stability analysis in nonlinear programming. Bellman R. Mathematics in science and engineering. 165:1983;Academic Press, New York.
4. Hans J. Zimmermann, Fuzzy programming and linear programming with several objective functions. Fuzzy Sets and Systems. 1:1978;45-55.
5. Sakawa M. Fuzzy sets and interactive multiobjective optimization. 1993;Plenum, New York.
6. Rockafellar R.T., Wets R.J.-B. Scenarios and policy aggregation in optimization under uncertainty. Mathematics of OR. 16:(1):1991;119-147.
7. Mulvey J.M., Vanderbei R.J., Zenios S.A. Robust optimization of large-scale systems. Operations Research. 43:(2):1995;264-281.
8. Krasnoshchekov P.S., Morozov V.V., Fedorov V.V. Decomposition in planning problems. Engineering Cybernetics. 17:(3):1979;1-10.
9. Krasnoshchekov P.S., Morozov V.V., Fedorov V.V. Planning of technological systems of multipurpose assignment. Engineering Cybernetics. 17:(4):1979;5-11.
10. Krasnoshchekov P.S., Morozov V.V., Fedorov V.V. Sequential clustering in internal design problems of engineering systems. Engineering Cybernetics. 17:(5):1979;1-7.
11. Spronk J., Telgen J. An ellipsoidal interactive multiple goal programming method. Lecture notes in economics and mathematical systems. 190:1981;380-387 Springer-Verlag, Berlin.
12. Abhyankar S.S., Morin T.L., Trafalis T. Efficient faces of polytopes: interior point algorithms, parameterization of algebraic varieties, and multiple objective optimization. Contemporary Mathematics. 114:1990;319-341.
13. Vaidya PM. A new algorithm for minimizing a convex function over convex sets. In: Proceedings of the 30th annual symposium on foundations of computer science 1990. Computer Society Press. p. 338-43.
14. Sonnevend Gy. An 'analytical centre' for polyhedrons and newclasses of global algorithms for linear (smooth, convex) programming. Lecture Notes in Control and Information Sciences. 84:1985;866-875.
15. Tarasov S.P., Khachiyan L.G., Erlikh I.I. The method of inscribed ellipsoids. Soviet Mathematics Doklady. 37:1988;226-230.
16. Den Hertog D. Interior point approach to linear, quadratic and convex programming. 1994;Kluwer Academic Publishers, Dordrecht.
17. Escudero L.F. Production planning via scenario modeling. Annals of Operations Research. 43:1993;311-335.
18. Trafalis T., Mishina T. A circumscribed ellipsoid method for multiobjective planning and applications to financial planning. Zopounidis C. New operational approaches for financial modelling. 1997;377-388 Physica-Verlag, Wurzburg.
19. Arbel A. An interior multiobjective linear programming algorithm. Computers and Operations Research. 20:(7):1993;723-735.