I. Introduction
Nonlinear programming is an important branch of mathematical programming. Its theory and methods have become important means of modern decision making. Since 1940s, people have done a lot of researches on the theory and applications of nonlinear programming. It has spawned many new fields. However while an actual nonlinear optimization model is established, decision makers often give various constraint conditions according to their different needs and angles, so it is inevitable that the given constraint conditions for the model are incompatible. For this reason, this paper considers the problem of major constrained programming whose major constraint conditions are compatible.