| Article ID: | iaor200971774 |
| Country: | Russia |
| Volume: | 70 |
| Issue: | 10 |
| Start Page Number: | 1606 |
| End Page Number: | 1612 |
| Publication Date: | Oct 2009 |
| Journal: | Automation and Remote Control |
| Authors: | Burkova I V |
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.