Now showing items 1-4 of 4
On incomplete lagrange function and saddle point optimality criteria in mathematical programming
An incomplete Lagrange function is used to study saddle point optimality criteria for a class of nonlinear programming problems under generalized convexity assumptions. This study is further extended to certain class of ...
A note on pseudo-invexity and duality in nonlinear programming
Certain shortcomings are pointed out in the recent work of (S. Nanda, L.N. Das, European Journal of Operational Research 88 (1996) 572-577) and appropriate modifications are suggested for studying duality under pseudo-invexity ...
On mixed duality in mathematical programming
An incomplete Lagrange function is introduced for a class of nonlinear programming problems which explains the reason behind the construction of the Mond–Weir–type dual. A mixed-type dual is presented for a class of ...
Technical note on symmetric duality in multiobjective programming: Some remarks on recent results
Certain shortcomings are pointed out in some recent works of Das and Nanda [European Journal of Operational Research 97 (1997) 167-171] and Kim et al. [European Journal of Operational Research 107 (1998) 686-691] which ...