Duality in disjunctive linear fractional programming
作者： Vivek Patkar , I.M. Stancu-Minasian
DOI: 10.1016/0377-2217(85)90093-1
关键词:
摘要: Abstract In this note a dual problem is formulated for given class of disjunctive linear fractional programming problems. This result generalizes to the duality theorem originated by Balas. Two examples are illustrate result.
elsevier.com
sci-hub.se 参考文章(4)
R.G. Jeroslow, Cutting-Plane Theory: Disjunctive Methods Studies in Integer Programming. ,vol. 1, pp. 293- 330 ,(1977) , 10.1016/S0167-5060(08)70741-6
B.D Craven, B Mond, The dual of a fractional linear program Journal of Mathematical Analysis and Applications. ,vol. 42, pp. 507- 512 ,(1973) , 10.1016/0022-247X(73)90158-3
E. Balas, A Note on Duality in Disjunctive Programming. Journal of Optimization Theory and Applications. ,vol. 21, pp. 523- 528 ,(1977) , 10.1007/BF00933095
R. G. Jeroslow, Cutting-Planes for Complementarity Constraints SIAM Journal on Control and Optimization. ,vol. 16, pp. 56- 62 ,(1978) , 10.1137/0316005