Solving a Linear Multiperiod Portfolio Problem by Interior-Point Methodology

Ralf Ostermark

Computer Science in Economics & Management, 1992, vol. 5, issue 4, 283-302

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 centres 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. Citation Copyright 1992 by Kluwer Academic Publishers.

Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:csecmg:v:5:y:1992:i:4:p:283-302

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/10614/PS2

Access Statistics for this article

Computer Science in Economics & Management is currently edited by Hans Amman

More articles in Computer Science in Economics & Management from Kluwer, Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().