A method of network programming in problems of nonlinear optimization

被引:8
作者
Burkova, I. V. [1 ]
机构
[1] Russian Acad Sci, Trapeznikov Inst Control Sci, Moscow, Russia
关键词
02.10.Ox;
D O I
10.1134/S0005117909100026
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1606 / 1612
页数:7
相关论文
共 5 条
[1]  
Burkhardt ER, 2005, CHIM OGGI, V23, P29
[2]  
Burkov V.N., 2004, SB T I PROBL UPRAVLE, P57
[3]  
BURKOV VN, 2001, TEORIYA GRAFOV UPRAV
[4]  
Garey M. R., 1979, COMPUTERS INTRACTABI
[5]  
2005, MATEMATICHESKIE OSNO, P312