Translating a minimal value problem which is equivalent with Moran conjecture into nonlinear programning problem is discussed,and solved it by K-T condition.So Moran conjecture has been proofed.

• 将一个与莫朗猜想等价的极小值问题转化为非线性规划问题，并利用K-T条件求解，从而证明了莫朗猜想.