摘要
This paper derives a new constraint qualification for nondifferential convex programming problem, by using the distance between the feasible set and the perturbed feasible sets. If the feasible sot is bounded, then this constraint qualification is weaker than Stater's constrains qualification.
This paper derives a new constraint qualification for nondifferential convex programming problem, by using the distance between the feasible set and the perturbed feasible sets. If the feasible sot is bounded, then this constraint qualification is weaker than Stater's constrains qualification.
基金
the National Natural Science Foundation of China (No.19671053).