Solving scalarized multi-objective network flow problems using an interior point method

International Transactions in Operational Research

Volumn 17, Issue 5, 2010, Pages 607-636

  Fonseca, Margarida ^a   Figueira, José Rui ^b   Resende, Mauricio G C ^c  

^a INESC COIMBRA   (Portugal)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Achievement functions; Decision making; Interior point methods; Multi objective network flows

Indexed keywords

EID: 84919724703     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2010.00761.x     Document Type: Article

References (38)

1. Aghezzaf, B., Ouaderhman, T., 2001. An interactive interior point algorithm for multiobjective linear programming problems. Operations Research Letters 29, 4, 163–170.
2. Arbel, A., 1993. An interior multiobjective linear programming algorithm. Computers & Operational Research 20, 7, 723–735.
3. Arbel, A., 1994a. Anchoring points and cones of opportunities in interior multiobjective linear programming. Journal of the Operational Research Society 45, 1, 83–96.
4. Arbel, A., 1994b. A multiobjective interior primal-dual linear programming algorithm. Computers & Operations Research 21, 4, 433–445.
5. Arbel, A., 1995. An interior multiple objective primal-dual linear programming algorithm using efficient anchoring points. Journal of the Operational Research Society 46, 9, 1121–1132.
6. Arbel, A., 1997. An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points. Computers & Operations Research 24, 4, 353–365.
7. Arbel, A., Korhonen, P., 1996a. Using aspiration levels in an interactive interior multiobjective linear programming algorithm. European Journal of Operational Research 89, 1, 193–201.
8. Arbel, A., Korhonen, P., 1996b. Using aspiration levels in an interior primal-dual multiobjective linear programming algorithm. Journal of Multi-Criteria Decision Analysis 5, 2, 61–71.
9. Arbel, A., Korhonen, P., 2001. Using objective values to start multiple objective linear programming algorithms. European Journal of Operational Research 128, 3, 587–596.
10. Arbel, A., Oren, S., 1993. Generating interior search directions for multiobjective linear programming. Journal of Multi-Criteria Decision Analysis 2, 2, 73–86.
11. Arbel, A., Oren, S., 1996. Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm. European Journal of Operational Research 89, 1, 202–211.
12. Baryamureeba, V., Steihaug, T., 2006. On the convergence of an inexact primal-dual interior point method for linear programming. In Linkov, I., Margenov, S., Wasniewski, J. (eds), Large-Scale Scientific Computing: Lecture Notes in Computer Science, Vol. 374. Springer, Berlin, Heidelberg, pp. 629–637.
13. Baryamureeba, V., Steihaug, T., Zhang, Y., 1999. Properties of a class of preconditioners for weighted least squares problems. Technical report, Department of Informatics, University of Bergen, Norway, No. 170.
14. Castro, J., 2005. An interior-point approach for primal block-angular problems. Technical report, Dept. of Statistics and Operations Research, Universitat Politecnica de Catalunya, Barcelona, Spain, September, No. 20.
15. Figueira, J., Greco, S., Ehrgott, M., 2005. Multiple Criteria Decision Analysis: State of the Art Surveys, volume 78 of International Series in Operations Research & Management Science. Springer Science+Business Media Inc., New York.
16. Freund, R., Jarre, F., 1997. A QMR-based interior-point algorithm for solving linear programs. Mathematical Programming 76, 183–210.
17. Freund, R., Jarre, F., Mizuno, S., 1999. Convergence of a class of inexact interior-point algorithms for linear programs. Mathematics of Operations Research 24, 1, 50–71.
18. Klingman, A., Napier, A., Stutz, J., 1974. Netgen: A program for generating large scale capacitated assignment, transportation, and minimum cost network flow problems. Management Science 20, 5, 814–821.
19. Kojima, M., Megiddo, N., Mizuno, S., 1993. A primal-dual infeasible-interior-point algorithm for linear programming. Mathematical Programming 61, 3, 263–280.
20. Kojima, M., Mizuno, S., Yoshise, A., 1989. A primal-dual interior-point algorithm for linear programming. In Megiddo, N. (ed.), Progress in Mathematical Programming, Interior-Point and Related Methods. Spring-Verlag, New York, pp. 29–47.
21. Korhonen, P., Laakso, J., 1986. A visual interactive method for solving the multiple criteria problem. European Journal of Operational Research 24, 2, 277–287.
22. Korhonen, P., Wallenius, J., 1988. A Pareto race. Naval Research Logistics 35, 6, 615–623.
23. Korzak, J., 2000. Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems. SIAM Journal on Optimization 11, 1, 133–148.
24. McShane, K., Monma, C., Shanno, D., 1989. An implementation of a primal-dual interior point method for linear programming. ORSA Journal on Computing 1, 70–83.
25. Megiddo, D., 1989. Pathways to the optimal set in linear programming. In Megiddo, N. (ed.), Progress in Mathematical Programming, Interior-Point and Related Methods. Springer-Verlag, New York, pp. 131–158.
26. Mizuno, S., Jarre, F., 1999. Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. Mathematical Programming 84, 357–373.
27. Monteiro, R., Adler, I., 1989. Interior path following primal-dual algorithms. Part I: Linear programming. Mathematical Programming 44, 1, 27–41.
28. Monteiro, R., O'Neal, J., 2003. Convergence analysis of a long-step primal-dual infeasible interior-point lp algorithm based on iterative linear solvers. Technical report, School of ISyE, Georgia Tech, USA, October.
29. Oliveira, A., Sorensen, D., 1997. Computational experience with a preconditioner for interior point methods for linear programming. Technical report, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, No. 28.
30. Portugal, L., Bastos, F., Júdice, J., Paixão, J., Terlaky, T., 1996. An investigation of interior point algorithms for the linear transportation problem. SIAM Journal on Scientific Computing 17, 1202–1223.
31. Portugal, L., Resende, M., Veiga, G., Júdice, J., 2000. A truncated primal-infeasible dual-feasible network interior point method. Networks 35, 91–108.
32. Portugal, L.F., Resende, M.G.C., Veiga, G., Patrício, J., Júdice, J.J., 2008. Fortran subroutines for network flow optimization using an interior point algorithm. Pesquisa Operacional 28, 243–261.
33. Resende, M., Veiga, G., 1993. An implementation of the dual affine scaling algorithm for the minimum cost flow on bipartite uncapacited networks. SIAM Journal on Optimization 3, 516–537.
34. Steuer, R., 1986. Multiple Criteria Optimization: Theory, Computation and Application. John Wiley & Sons, New York.
35. Tanabe, K., 1988. Centered Newton method for mathematical programming. In Iri, M., Yajima, K. (eds), System Modeling and Optimization: Proceedings of the 13th IFIP Conference, Tokyo, Japan, Aug./Sept. interior–point 1987, Vol. 113, Springer-Verlag, New York, pp. 197–206.
36. Trafalis, T., Morin, T., Abhyankar, S., 1990. Efficient faces of polytopes: Interior point algorithms, parameterization of algebraic varieties, and multiple objective optimization. In Lagarias, J.C., Todd, M.J. (eds), Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July 1988, Vol. 114 of Contemporary Mathematics. American Mathematical Society, Providence, RI, pp. 319–341.
37. Wierzbicki, A., 1980. The use of reference objectives in multiobjective optimisation. In Fandel, G., Gal, T. (eds), Multiple Criteria Decision Making, Theory and Application, Proceedings, No. 177 in LNEMS, Springer-Verlag, Hagen, pp. 468–486.
38. Wierzbicki, A., 1986. On the completeness and constructiveness of parametric characterizations to vector optimization problems. OR-Spectrum 8, 2, 73–87.