IDEAS home Printed from https://ideas.repec.org/a/cvt/journl/yid671.html
   My bibliography  Save this article

Modified algorithm for Kornai-Liptak two-level optimization

Author

Listed:
  • D. A. Maximov

  • A. A. Mikhailova

  • A. I. Deryabina

Abstract

Integration processes in the modern economy, including the Russian one, actualize the problem of increasing the synergistic effect of combining the specific assets of previously independent enterprises not only in the strategic planning interval, but also in the medium-term time interval. This is dictated by the need to increase the profitability of the market activities of the integratedgroup and the profitability of the assets of enterprises included in the integrated group. This problem is considered in the tasks of multi-level optimization of enterprises of an integrated group, which are solved using the well-known methods of multi-level optimization, for example, Kornai-Liptak. However, this and other known methods in some cases (for example, in the one considered in this paper) cannot be fully recognized as correct due to low convergence and looping of the algorithm. In this connection, in some cases it becomes necessary to use a modification of the original Kornai-Liptak algorithm to improve the accuracy of estimates and the rate of convergence of the numerical algorithm. One of these modifications, based on a heuristic approach to assessing the level of scarcity of company-wide resources, is given in this paper. It is shown that the modified allows to obtain the optimal production program of Kalashnikov Group JSC

Suggested Citation

  • D. A. Maximov & A. A. Mikhailova & A. I. Deryabina, 0. "Modified algorithm for Kornai-Liptak two-level optimization," Scientific notes of the Russian academy of entrepreneurship, JSC “Publishing Agency “Science and Educationâ€, vol. 17(4).
  • Handle: RePEc:cvt:journl:y::id:671
    as

    Download full text from publisher

    File URL: https://www.scinotes.ru/jour/article/viewFile/671/671
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cvt:journl:y::id:671. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Ð ÐµÐ´Ð°ÐºÑ†Ð¸Ñ (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.