Abstract
The previous chapter presented an initial discussion of computational issues related to solving large scale multiobjective linear programming problems. The discussion was restricted to problems which can be structured as multiobjective network flow problems. This chapter will broaden the discussion to linear programming problems with general structure. The discussion will describe a study of the computational requirements for obtaining a representation of the ideal solution for large scale multiobjective linear programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ali, A. I., and J. L. Kennington, “SMU-LP an In-core Primal Simplex Code for Solving Linear Programs (Version 1.0),” Technical Report OR80015, Department of Operations Research, Southern Methodist University, Dallas, 1980.
Armstrong, R, A. Charnes, and C. Haksever, “Successive Linear Programming for Ratio Goals,” European Journal of Operational Research,” 32 (1987), 426–434.
Armstrong, R., A. Charnes, and C. Haksever, “Implementation of Successive Linear Programming Algorithms for Non-Convex Goal Programming,” Computers and Operations Research, 15 (1988), 37–49
Charnes, A, W. M. Raike, J. D. Stutz, and A. S. Waters, “ On Generation of Test Problems for Linear Programming Codes,” Communications of the ACM, 17 (1974), 583–586.
Charnes, A, and W. W. Cooper, “Goal Programming and Multiple Objective Optimization, Part 1,” European Journal of Operational Research, 1 (1977), 39–54.
Cheng, M. C., “Recent Development in the Simplex Algorithm,” Proceedings of the Mathematical Seminar: Singapore 1980, K. C. Cheng and C. T. Chong (Eds.), Singapore Mathematical Society and Mathematics Department, N. U. S. Singapore, (1981) 6–19.
Cheng, M. C., “Generalized Theorems for Permanent Basic and Nonbasic Variables,” Mathematical Programming, 31 (1985), 229–234.
Golden, B., L. Bodin, T. Doyle, and W. Stewart Jr., “Approximate Travelling Salesman Algorithms,” Operations Research, 28 (1980), 694–711.
Golden, B., and W. R. Stewart, “Empirical Analysis of Heuristics,” in E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (Eds.) The Travelling Salesman Problem, Wiley, Chichester, England, 1985.
Haksever, C. “An Implementation and Computational Evaluation of New Criteria for the Simplex Method,” presented at the conference in honor of A. Charnes on his 70th birthday, October 14-15, 1987, IC2 Institute, The University of Texas, Austin.
Haksever, C. and J. L. Ringuest, “Computational Experiments on the Efficient Implementation of Some MOLP Algorithms,” Working Paper, 1989.
Haksever, C. and J. L. Ringuest, “Computational Efficiency and Interactive MOLP Algorithms: An Implementation of the SIMOLP Procedure,” Computers and Operations Research, 17 (1989) pp. 39–50.
Keeney, R. L. and H. Raiffa, Decisions with Multiple Objectives: Preferences and Value Tradeoffs, Wiley, New York, 1976.
Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (Eds.), The Travelling Salesman Problem, Wiley, Chichester, England, 1985.
Reeves, G. R, and L. S. Franz, “A Simplified Interactive Multiple Objective Linear Programming Procedure,” Computers and Operations Research, 12 (1985), 589–601.
Rosenkrantz, D. J., R. E. Stearns, and P. M. Lewis II, “An Analysis of Several Heuristics for the Travelling Salesman Problem,” SIAM Journal on Computing, 6 (1974), 563–581.
Steuer, R.E., Multiple Criteria Optimization: Theory, Computation, and Application, Wiley, New York, 1986.
Zionts, S. and J. Wallenius, “An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions,” Management Science, 29 (1983), 519–529.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ringuest, J.L. (1992). Computational Efficiency and Linear Problems of General Structure. In: Multiobjective Optimization: Behavioral and Computational Considerations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3612-3_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3612-3_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6605-8
Online ISBN: 978-1-4615-3612-3
eBook Packages: Springer Book Archive