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.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Volume (Year): 5 (1992) Issue (Month): 4 (November) Pages: 283-302 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
Handle: RePEc:kap:csecmg:v:5:y:1992:i:4:p:283-302
Contact details of provider:
For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).