Abstract
In this report we formulate a linear multiperiod programming problem and show how it can be solved by a new interior point algorithm. The conditions of convergence and applicability of the algorithm of centers are explicitly connected to the multiperiod programming problem. For the former, effective application is supported by a set of simplifying conditions stated and proved in the text. For the latter, boundedness and nontriviality under real world conditions is demonstrated, allowing for its solution by the interior point algorithm. The use of a fast interior point algorithm is motivated by some empirical evidence from a Revised Simplex optimizer.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abhyankar, S., Morin, T.L., and Trafalis, S., 1989, Efficient faces of polytopes: Interior point algorithms, parameterization of algebraic varieties and multiple objective optimization, Computational Combinatorics, Purdue University, Indiana.
Bayer, D. and Lagarias, J., 1986, Geometry of linear programming: I, II & III, Technical reports, Department of Mathematics, Columbia University, New York.
Birge, J.R. and Oi, L., 1988, Computing block-angular Karmarkar projections with applications to stochastic programming, Management Sci. 34 (12), 1472–1479.
Chankong, V. and Haimes, Y., 1983, Multiobjective Decision Making. Theory and Methodology, North-Holland, Amsterdam.
Ferris, M.C. and Philpott, A.B., 1988, On the performance of Karmarkar's algorithm, J. Oper. Res. Soc. 39(3), 257–270.
Hazen, G. and Morin, T., 1984, Steepest ascent algorithms for nonconical multiple objective programming, J. Math. Anal. Appl. 100, 188–221.
Hooker, J.N., 1986, Karmarkar's linear programming, Algorithm Interfaces 16(4), 75–90.
Hwang, C.L. and Masud, A.S., 1979, Multiple Objective Decision Making. Methods and Applications, New York.
Karmarkar, N., 1984, A new polynomial-time algorithm for linear programming, Combinatorica 4, 373–395.
Kasanen, E. and Östermark, R., 1987, The managerial viewpoint in interactive programming with multiple objectives, Kybernetes 16, 235–240.
Khachian, L. G., 1979, A polynomial algorithm for linear programming, Dokl Akad. Nauk SSSR, 244, 1093–1096.
Keeney, R. and Raiffa, H., 1976, Decisions with Multiple Objectives: Preferences and Value Tradeoffs, Wiley, New York.
Korhonen, A., 1987, A dynamic bank portfolio planning model with multiple scenarios, multiple goals and changing priorities, European J. Oper. Res. 30, 13–23.
Morin, T.L. and Trafalis, T.B., 1988, Interior point methods in multiple objective optimization, Joint National ORSA/TIMS Meeting, Vancouver, Canada.
Nakayama, H., 1988, An interactive support system for bond trading, Department of Applied Mathematics, Konan University, Discussion Paper presented at the VIIIth International Congress on MCDM, Manchester, England, August 1988.
Östermark, R., 1991, Vector forecasting and dynamic portfolio selection. Empirical efficiency of recursive multiperiod strategies, European J. Oper. Res. 55, 46–56.
Renegar, J., 1986, A polynomial-time algorithm, based on Newton's method, for linear programming, Report 07118-86, Mathematical Sciences Research Institute, University of California, Berkeley, CA.
Scales, L.E., 1985, Introduction to Non-Linear Optimiztion, MacMillan, New York.
Searle, S., 1982, Matrix Algebra, Useful for Statistics, Wiley, New York.
Sonnevend, G., 1985, An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, Proc. 12th IFIP Conference on Systems Modelling, Budapest, 1985.
Steuer, R., 1986, Multiple Criteria Optimization: Theory, Computation and Application, Wiley, New York.
Vaidya, R.M., 1987, A locally well-behaved potential function and a simple Newton-type method for finding the center of a polytope, Technical Report AT&AT Bell Laboratories, Murray Hill, NJ.
Wierzbicki, A., 1986, On the completeness and constructiveness of parametric characteristions to vector optimization problems, OR Spectrum 2, 73–88.
Yu, P.L. and Zeleny, M., 1975, The set of all nondominated solutions in linear cases and a multicriteria simplex method J. Math. Anal. Appl. 49, 430–468.
Zeleny, M., 1982, Multiple Criteria Decision Making, McGraw-Hill, New York.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Östermark, R. Solving a linear multiperiod portfolio problem by interior-point methodology. Computer Science in Economics and Management 5, 283–302 (1992). https://doi.org/10.1007/BF00436583
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00436583