Abstract
A method of network programming for solving problems of nonlinear optimization is used. A notion of dual problem is introduced. It is proved that a dual problem is a problem of convex programming. Necessary and sufficient conditions for optimality of dual problem of integer linear programming are obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burkov, V.N., Zalozhnev, A.Yu., and Novikov, D.A., Teoriya grafov v upravlenii organizatsionnymi sistemami (Graph Theory in Control of Organizational Systems), Moscow: Sinteg, 2001.
Burkov, V.N. and Burkova, I.V., A Method of Network Programming, Probl. Upravlen., 2005, no. 3, pp. 23–29.
Burkov, V.N. and Burkova, I.V., A Method of Dichotomous Programming, in Sb. Tr. Inst. Probl. Upravlen. Ross. Akad. Nauk, 2004, pp. 57–75.
Garey, M.R. and Johnson, D.S., Computers and Intractability. A Guide to the Theory of NPCompleteness, San Fransisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
Matematicheskie osnovy upravleniya proektami. Uchebnoe posobie (Mathematical Principals of Project Control. A Handbook), Moscow: Vysshaya Shkola, 2005, pp. 312–336.
Author information
Authors and Affiliations
Additional information
Original Russian Text © I.V. Burkova, 2009, published in Avtomatika i Telemekhanika, 2009, No. 10, pp. 15–21.
Rights and permissions
About this article
Cite this article
Burkova, I.V. A method of network programming in problems of nonlinear optimization. Autom Remote Control 70, 1606–1612 (2009). https://doi.org/10.1134/S0005117909100026
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117909100026