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 th...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).
文摘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.
