Abstract
A nonsmooth minmax programming problem, under the assumption of proper (b, η) – invexity conditions on the functions involved in the objective and in the constraints, is considered. For such a problem, a sufficient optimality theorem is proved, a Wolfe type dual is presented and duality theorems relating the primal and the dual are proved. Applications of these results to certain nonsmooth fractional and nonsmooth generalized fractional programming duality are also presented.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call