Mixed duality without a constraint qualification for minimax fractional programming

Authors: Houchun Zhou; Wenyu Sun

Source: Optimization, Volume 52, Numbers 4-5, Numbers 4-5/August-October 2003 , pp. 617-627(11)

Buy & download fulltext article:

Price: $56.94 plus tax (Refund Policy)

Abstract:

Without the need of a constraint qualification, we establish the necessary and sufficient optimality conditions for minimax fractional programming. Using these optimality conditions, we construct a mixed dual model which unifies the Mond-Weir dual, Wolfe dual and a parameter dual models. Several duality theorems are established. Consequently, this article partly solves the problem posed by Lai et al. [H.C. Lai, J.C. Liu and K. Tanaka (1999). Duality without a constraint qualification for minimax fractional programming. Journal of Optimization Theory and Applications, 101, 109-125.].

Keywords: Minimax fractional programming; Optimality conditions; Cone directions; Mixed duality; Mathematics Subject Classifications 2000: 49N15; 49K35; 90C32

Document Type: Research article

DOI: http://dx.doi.org/10.1080/02331930310001611574

Affiliations: 1: School of Mathematics and Computer Science Nanjing Normal University Nanjing 210097 China

Publication date: 2003-08-01