Using aspiration levels in an interior primal-dual multiobjective linear programming algorithm

Journal of Multi-Criteria Decision Analysis

Volumn 5, Issue 1, 1996, Pages 61-71

  Arbel, Ami ^a   Korhonen, Pekka ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b HELSINKI SCHOOL OF ECONOMICS   (Finland)

Author keywords

Aspiration levels; Interior point algorithms; Multiple objective linear programming; Path following primal dual algorithm; Scalarizing functions

Indexed keywords

EID: 0342572046     PISSN: 10579214     EISSN: 10991360     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1360(199603)5:1<61::AID-MCDA84>3.0.CO;2-C     Document Type: Article

References (17)

1. Arbel, A., Exploring Interior Point Linear Programming: Algorithms and Software, Cambridge, MA:MIT Press, 1993a.
2. Arbel, A., ‘An interior multiobjective linear programming algorithm’, Comput. Oper. Res., 20, 723-735(1993b).
3. Arbel, A., ‘Anchoring points and cones of opportunities in interior multiobjective linear programming problems’, J. Oper. Res. Soc., 45, 83-96(1994).
4. Cheng, Y.-C., Houck, D. J., Liu, J.-M., Meketon, M. S., Slutsman, L., Vanderbei, R. J., and Wang, P., ‘The AT&T KORBX® system’, AT&T Tech. J., 68(3), 7-19(1989).
5. Geoffrion, A. M., Dyer, J. S., and Feinberg, A., ‘An interactive approach for multi-criterion optimization, with an application to the operations of an academic department’, Manag. Sci., 19, 357-368(1972).
6. Halme, M., and Korhonen, P., ‘Nondominated tradeoffs and termination in interactive multiple objective linear programming’, in Lockett, A. G. and Islei, G. (eds), Improving Decision Making in Organizations, Berlin:Springer, 1989, pp. 410-423.
7. Karmarkar, N. K., ‘A new polynomial time algorithm for linear programming’, Combinatorica, 4, 373-395(1984).
8. Kojima, M., Mizuno, S., and Yoshise, A., ‘A primal-dual interior point algorithm for linear programming’, in Megiddo, N. (ed.), Progress in Mathematical Programming, Interior-Point and Related Methods, Berlin:Springer, 1989, pp. 29-48.
9. Korhonen, P., and Laakso, J., ‘A visual interactive method for solving the multiple criteria problem’, Eur. J. Oper. Res., 24, 277-287(1986).
10. Korhonen, P., and Wallenius, J., ‘A pareto race’, Naval Res. Logist., 35, 615-623(1988).
11. Korhonen, P., and Wallenius, J., ‘A multiple objective linear programming decision support system’, Decis. Support Syst., 6, 243-251(1990).
12. Kranich, E., ‘Interior point methods for mathematical programming: a bibliography’, Discussion Paper No. 171, May1991, Institute of Economy and Operations Research, Fern Universität Hagan, PO Box 940, D-5800 Hagen 1, Germany. (To get a copy via E-mail, send a message to netlib@research.att.com with the message send index from bib.)
13. McShane, K. A., Monma, C. L., and Shanno, D. F., ‘An implementation of a primal-dual interior point method for linear programming’, ORSA J. Comput., 1(2), 70-83(1989).
14. Megiddo, N. (ed.), Progress in Mathematical Programming: Interior-Point and Related Methods, Berlin:Springer, 1989.
15. Steuer, R. E., Multiple Criteria Optimization: Theory, Computation, and Application, New York:Wiley, 1986.
16. Wierzbicki, A., ‘The use of reference objectives in multiobjective optimization’, in Fandel, G. and Gal, T. (eds), Multiple Criteria Decision Making, Theory and Application, Berlin:Springer, 1980, pp. 468-486.
17. Wierzbicki, A., ‘On the completeness and constructiveness of parametric characterizations to vector optimization problems’, OR-Spectrum, 8, 73-87(1986).