Boundedness for Optimal Objective Function Value on Non-conic Convex Optimization Problems

In the case that the constraint is a general convex set and the primitive non-convex programming or its dual is feasible, the variation of the optimal objective function value for the new system is investigate when $d$ is perturbated.