Zero duality gap

In this paper we establish necessary and sufficient condition for zero duality gap of the optimization problem involving the general perturbation mapping via characteringsetunder the convex setting. An application to the class of composite optimization problems will also be given to show that our general results can be applied to various classes of optimization problems.

10p viporsche 28-10-2022 6 3   Download

In this paper we propose results on zero duality gap in vector optimization problems posed in a real locally convex Hausdorff topological vector space with a vector-valued objective function to be minimized under a set and a convex cone constraint. These results are then applied to linear programming.

14p nguaconbaynhay12 03-06-2021 13 1   Download