Ways to Develop Computing Means for Solving Large Optimal Planning and Control Problems
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 19 (1976)
Issue (Month): 4 (August)
|Contact details of provider:|| Web page: http://mesharpe.metapress.com/link.asp?target=journal&id=106047|
When requesting a correction, please mention this item's handle: RePEc:mes:prectr:v:19:y:1976:i:4:p:222-225. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Chris Nguyen)
If references are entirely missing, you can add them using this form.