About Disjunctive Optimization

作者: Ivan I. Eremin

DOI: 10.1007/978-1-4757-3403-4_2

关键词: Feasible regionDual (category theory)Disjunctive programmingReduction (recursion theory)LagrangianArgument (linguistics)Computer scienceAlgebraUnconstrained optimizationSaddle point

摘要: In this paper we investigate the problems of disjunctive programming with an infinite array components forming a feasible set (as their union). The investigation continues theme author’s article [7] and describes original conceptual approach to a) analysis saddle point problem for Lagrangian functions, b) dual relations problems, c) technique equivalent (with respect argument) reduction such unconstrained optimization.

参考文章(13)
I. I. Eremin, Theory of linear optimization VSP. ,(2002)
H. T. Jongen, J. J. Rückmann, O. Stein, Disjunctive Optimization: Critical Point Theory Journal of Optimization Theory and Applications. ,vol. 93, pp. 321- 336 ,(1997) , 10.1023/A:1022650006477
Hanif D. Sherali, C. M. Shetty, Optimization with disjunctive constraints ,(1980)
J. M. Borwein, A strong duality theorem for the minimum of a family of convex programs Journal of Optimization Theory and Applications. ,vol. 31, pp. 453- 472 ,(1980) , 10.1007/BF00934472
Willard I. Zangwill, Non-Linear Programming Via Penalty Functions Management Science. ,vol. 13, pp. 344- 358 ,(1967) , 10.1287/MNSC.13.5.344
Vivek Patkar, I.M. Stancu-Minasian, Duality in disjunctive linear fractional programming European Journal of Operational Research. ,vol. 21, pp. 101- 105 ,(1985) , 10.1016/0377-2217(85)90093-1
Egon Balas, Joseph M. Tama, Jørgen Tind, Sequential Convexification in Reverse Convex and Disjunctive Programming. Mathematical Programming. ,vol. 44, pp. 337- 350 ,(1989) , 10.1007/BF01587096
Siegfried Helbig, Duality in disjunctive programming via vector optimization Mathematical Programming. ,vol. 65, pp. 21- 41 ,(1994) , 10.1007/BF01581688
E. Balas, A Note on Duality in Disjunctive Programming. Journal of Optimization Theory and Applications. ,vol. 21, pp. 523- 528 ,(1977) , 10.1007/BF00933095