fabricate
发表于 2025-4-1 05:00:02
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