Abstract: A feasible trust algorithm which used maxim-entropy methods, a class of max-min problems with nonlinear constraints turn into nonlinear programming problems with inequality constraints is proposed. The algorithm which resolve general max-min problems is global convergent. Preliminary numerical experiments show that the proposed algorithm is effective.