Ways to Develop Computing Means for Solving Large Optimal Planning and Control Problems

Leonid Kantorovich

Problems of Economic Transition, 1976, vol. 19, issue 4-6, 222-225

Abstract: The solution of large optimal planning and control problems requires very cumbersome computational operations that are based on a very large body of initial data and that require the large volume of data processing entailed in the application of modern mathematical methods. One encounters a large volume of computations both in precise methods (linear algebra, linear programming, etc.) and in iterative, gradient, and especially combinatorial methods, in the methods of scanning, discrete and stochastic programming, and simulation methods. The complexity of the problems and the volume of the computations increase considerably with the transition from static to dynamic and forecasting problems.

Date: 1976
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
http://hdl.handle.net/10.2753/PET1061-199119040506222 (text/html)
Access to full text is restricted to subscribers.

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:mes:prectr:v:19:y:1976:i:4-6:p:222-225

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/MPET20

DOI: 10.2753/PET1061-199119040506222

Access Statistics for this article

More articles in Problems of Economic Transition from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().