Optimal Mathematical Models in Planning the Development of a Branch and in Technical Policy
AbstractThe return to the branch management of industry and its elevation to a new level create conditions favorable to the scientifically substantiated resolution of the problem of branch development as a whole in all its aspects. In this area considerable use must be made of mathematical methods and models as well as of analysis and calculations based on them. At the present time rather widespread use is being made of the simplest optimal models of the development and location of branches as well as models calculated by linear programming methods and in many cases resolved even on the basis of algorithms and the transport problem. (>u>1>/u>) Calculations of the development of branches as a whole or in individual regions have already been made for a number of branches with the aid of these models, and in preparing the plan for the next five years they must encompass a greater portion of the branches. The results of calculations for certain branches (e.g., the fuelenergy balance) were already considered in the compilation of the five-year plan for 1966-70.
Download InfoIf 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.
Bibliographic InfoArticle provided by M.E. Sharpe, Inc. in its journal Problems of Economic Transition.
Volume (Year): 19 (1976)
Issue (Month): 4 (August)
Contact details of provider:
Web page: http://mesharpe.metapress.com/link.asp?target=journal&id=106047
Other versions of this item:
- L. Kantorovich, 1968. "Optimal Mathematical Models in Planning the Development of a Branch and in Technical Policy," Problems of Economic Transition, M.E. Sharpe, Inc., vol. 11(3), pages 3-16, July.
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.