Titlebook: Generalized Convexity, Generalized Monotonicity and Applications; Proceedings of the 7 Andrew Eberhard,Nicolas Hadjisavvas,Dinh The Luc Con

fabricate

Duality in Fractional Programming Problems with Set Constraintsx set is not necessarily open or closed. Under suitable generalized convexity assumptions we derive a weak, strong and strict converse duality theorem. By means of a suitable transformation of variables these results are then applied to a class of fractional programs involving a ratio of a convex an