Solution of the Generalized Dual Problem in the Network Programming Method

Author(s):  
Sergey Barkalov ◽  
Irina Burkova ◽  
Natalia Kalinina ◽  
Alexander Kashenkov
2021 ◽  
Vol 16 (1) ◽  
pp. 5-19
Author(s):  
Irina Burkova ◽  
Boris Titarenko ◽  
Amir Hasnaoui ◽  
Roman Titarenko

The paper deals with an application of the network (dichotomous) programming method for solving multi-extremal problems and discrete optimization problems. The concept of a generalized dual problem is introduced and a theorem on its convexity is proved. Network programming method is used to build a business-forming project portfolio as well as an algorithm for solving completely dependent related projects is developed. Also, this method is used to solve the problem of building a business-supporting project portfolio for which the lower cost estimate is obtained. A computational experiment is carried out to evaluate the suggested algorithm, which showed that for large dimensions of the problem it is more effective than for solving the problem by linear programming methods.


2020 ◽  
Vol 81 (6) ◽  
pp. 978-987
Author(s):  
V. N. Burkov ◽  
I. V. Burkova ◽  
V. G. Zaskanov

2019 ◽  
Vol 1399 ◽  
pp. 033031 ◽  
Author(s):  
A V Zimin ◽  
I V Burkova ◽  
O Ja Kravets ◽  
V V Zimin

2019 ◽  
Vol 22 (5) ◽  
pp. 119-126
Author(s):  
I. V. Burkova ◽  
B. K. Uandykov ◽  
Yu. A. Khalin

2014 ◽  
Vol 75 (3) ◽  
pp. 470-480 ◽  
Author(s):  
V. N. Burkov ◽  
I. V. Burkova

2003 ◽  
Vol 123 (3) ◽  
pp. 544-551 ◽  
Author(s):  
Kotaro Hirasawa ◽  
Masafumi Okubo ◽  
Jinglu Hu ◽  
Junichi Murata ◽  
Yuko Matsuya

2008 ◽  
Vol 128 (12) ◽  
pp. 1811-1819 ◽  
Author(s):  
Etsushi Ohkawa ◽  
Yan Chen ◽  
Zhiguo Bao ◽  
Shingo Mabu ◽  
Kaoru Shimada ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document