Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming

Published Online:https://doi.org/10.1287/ijoc.1050.0140

References

  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
  • Barr R. S., Farhangian K., Kennington J. L. Networks with side constraints: An LU factorization update. Ann. Soc. Logist. Engineers (1986) 1:66–85Google Scholar
  • Calvete H. I., Mateo P. M. An approach for the network flow problem with multiple objectives. Comput. Oper. Res. (1995) 22:971–983CrossrefGoogle Scholar
  • Chen S., Saigal R. A primal algorithm for solving a capacitated network flow problem with additional linear constraints. Networks (1977) 7:59–79CrossrefGoogle Scholar
  • Current J., Marsh M. Multiobjective transportation network design and routing problems: Taxonomy and annotation. Eur. J. Oper. Res. (1993) 65:4–19CrossrefGoogle Scholar
  • Current J., Min H. Multiobjective design of transportation networks: Taxonomy and annotation. Eur. J. Oper. Res. (1986) 26:187–201CrossrefGoogle Scholar
  • Drinka D., Sun M., Murray B. A multiple objective embedded network model for human resource planning and an implementation of the Tchebycheff method. Decision Sci. (1996) 27:319–341CrossrefGoogle Scholar
  • Ehrgott M., Gandibleux X. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum (2000) 22:425–460CrossrefGoogle Scholar
  • Gardiner L. R., Steuer R. E. Unified interactive multiple objective programming. Eur. J. Oper. Res. (1994) 74:391–406CrossrefGoogle Scholar
  • Glover F., Karney D., Klingman D., Russell R. Solving singly constrained transshipment problems. Transportation Sci. (1978) 12:277–297LinkGoogle Scholar
  • Glover F., Klingman D. The simplex SON algorithm for LP/embedded network problems. Math. Prog. Stud. (1981) 15:148–176CrossrefGoogle Scholar
  • Glover F., Klingman D. Basis exchange characterizations for the simplex SON algorithm for LP/embedded networks. Math. Prog. Stud. (1985) 24:141–157CrossrefGoogle Scholar
  • Glover F., Klingman D., Phillips N. V.Network Models in Optimization and Their Applications in Practice (1992) (Wiley, New York) CrossrefGoogle Scholar
  • Kennington J. L., Helgason R. V.Algorithms for Network Programming (1980) (Wiley, New York) Google Scholar
  • Kennington J. L., Whisman A. NETSIDE User's Guide. (1990) . Technical report 86-OR-01, Department of Operations Research, Southern Methodist University, Dallas, TXGoogle Scholar
  • Klingman D., Napier A., Stutz J. NETGEN—A program for generating large scale (un)capacitated assignment, transportation and minimum cost network problems. Management Sci. (1974) 20:814–822LinkGoogle Scholar
  • Lee H., Pulat P. S. Bicriteria network flow problems: Continuous case. Eur. J. Oper. Res. (1991) 51:119–126CrossrefGoogle Scholar
  • Lee H., Pulat P. S. Bicriteria network flow problems: Integer case. Eur. J. Oper. Res. (1993) 66:148–157CrossrefGoogle Scholar
  • Mulvey J. M. Pivot strategies for primal simplex network codes. J. Association Comput. Machinery (1978a) 25:266–270CrossrefGoogle Scholar
  • Mulvey J. M. Testing of a large scale network optimization program. Math. Prog. (1978b) 15:291–314CrossrefGoogle Scholar
  • Murty K. G.Network Programming (1992) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Pulat P. S., Huarng F., Lee H. Efficient solutions for the bicriteria network flow problem. Comput. Oper. Res. (1992) 19:649–655CrossrefGoogle Scholar
  • Ogryczak W., Zorychta K. On solving multiobjective linear programs with implict representation of minimax scalarizing function. Arch. Control Sci. (1994) 39:193–209Google Scholar
  • Ogryczak W., Studziński K., Zorychta K. A solver for the multi-objective transshipment problem with facility location. Eur. J. Oper. Res. (1989) 43:53–64CrossrefGoogle Scholar
  • Ogryczak W., Studziński K., Zorychta K. DINAS: A computer-assisted analysis system for multiobjective transshipment problems with facility location. Comput. Oper. Res. (1992) 19:637–647CrossrefGoogle Scholar
  • Steuer R. E.Multiple Criteria Optimization: Theory, Computation, and Application (1986) (Wiley, New York) Google Scholar
  • Steuer R. E. User's Manual of the ADBASE Multiple Objective Programming Package. (1992) (Terry College of Business, The University of Georgia, Athens, GA) Google Scholar
  • Steuer R. E. Difficulties in solving multicriteria networks: A combined weighted sum/Tchebycheff/aspiration criterion vector interactive procedure. 12th Internat. Conf. Multiple Criteria Decision Making (1995) Hagen, GermanyGoogle Scholar
  • Steuer R. E., Choo E.-U. An interactive weighted Tchebycheff procedure for multiple objective programming. Math. Prog. (1983) 26:326–344CrossrefGoogle Scholar
  • Steuer R. E., Piercy C., Lawrence K. D. Difficulties in solving network multiple objective linear programming problems. Multi-Criteria Applications, Applications of Management Science (2000) 10(Elsevier Science, New York) 217–231Google Scholar
  • Steuer R. E., Gardiner L. R., Gray J. A bibliographic survey of the activities and international nature of multiple criteria decision making. J. Multi-Criteria Decision Anal. (1996) 5:195–217CrossrefGoogle Scholar
  • Sun M. Interactive multiple objective programming procedures via adaptive random search and feed-forward artificial neural networks. (1992) . Ph.D. dissertation, Terry College of Business, The University of Georgia, Athens, GAGoogle Scholar
  • Sun M. A multiple objective network programming solution procedure. (1998) INFORMS National MeetingSeattle, WAGoogle Scholar
  • Sun M. Finding integer efficient solutions for multiple objective network programming problems. (2000) . Working paper, College of Business, The University of Texas at San Antonio, San Antonio, TXGoogle Scholar
  • Sun M. Procedures for finding nondominated solutions for multiple objective network programming problems. Transportation Sci. (2003) 37:139–152LinkGoogle Scholar
  • Sun M., Stam A., Steuer R. E. Solving multiple objective programming problems using feed-forward artificial neural networks: The interactive FFANN procedure. Management Sci. (1996) 42:835–849LinkGoogle Scholar
  • Sun M., Stam A., Steuer R. E. Interactive multiple objective programming using Tchebycheff programs and artificial neural networks. Comput. Oper. Res. (2000) 27:601–620CrossrefGoogle Scholar
  • Wierzbicki A. P. Basic properties of scalarizing functions for multiobjective optimization. Math. Operationsforsch. Statist. Ser. Optim. (1977) 8:55–60CrossrefGoogle Scholar
  • Wierzbicki A. P. The use of reference objectives in multiobjective optimization. Lecture Notes Economics and Mathethematics Systems (1980) 177(Springer-Verlag, New York) 468–486CrossrefGoogle Scholar
  • Wierzbicki A. P. A mathematical basis for satisficing decision making. Math. Model. (1982) 3:391–405CrossrefGoogle Scholar
  • Wierzbicki A. P., Makowski M., Wessels J.Model Based Decision Support Methodology with Environmental Applications (2000) (Kluwer, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Yu P.-L.Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions (1985) (Plenum Press, New York) CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.