IDEAS home Printed from https://ideas.repec.org/a/scn/022092/8157715.html
   My bibliography  Save this article

Механизмы Стимулирования Сокращения Сроков Реализации Проектов При Линейных Функциях Затрат

Author

Listed:
  • Бурков Владимир Николаевич

    (Учреждение Российской академии наук Институт проблем управления РАН)

  • Цветков Александр Васильевич

    (Учреждение Российской академии наук Институт проблем управления РАН)

  • Сычев Анатолий Петрович

    (ЦНИИ Транспортного строительства)

Abstract

Даны постановки задач стимулирования сокращения сроков реализации проектов. Решена задача разработки унифицированной линейной системы стимулирования сокращения сроков реализации проекта. Для решения задачи введены понятия пропускной способности пути и мощности разреза и доказана теорема двойственности о равенстве максимальной пропускной способности путей и минимальной мощности разрезов.Incentive problems to reduce projects execution time are put. The optimal unified linear incentive scheme is found that reduces project execution time. The solution is based on the notions of network path capacity and the power of a cutset. A sort of duality theorem is proven to establish the equality of the maximum ways capacity and the minimum power of cutsets.

Suggested Citation

  • Бурков Владимир Николаевич & Цветков Александр Васильевич & Сычев Анатолий Петрович, 2009. "Механизмы Стимулирования Сокращения Сроков Реализации Проектов При Линейных Функциях Затрат," Управление большими системами: сборник трудов, CyberLeninka;Федеральное государственное бюджетное учреждение науки Институт проблем управления им. В.А. Трапезникова РАН, issue 25, pages 84-95.
  • Handle: RePEc:scn:022092:8157715
    as

    Download full text from publisher

    File URL: http://cyberleninka.ru/article/n/mehanizmy-stimulirovaniya-sokrascheniya-srokov-realizatsii-proektov-pri-lineynyh-funktsiyah-zatrat
    Download Restriction: no
    ---><---

    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:scn:022092:8157715. 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: CyberLeninka (email available below). General contact details of provider: http://cyberleninka.ru/ .

    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.