An Interval Algorithm for Nonlinear Programming with Nonlinear Equality and Inequality Constraints
Liang Xiao-bin · College Mathematics · 2009
Base on the bisection rule of Moore,transforming nonlinear programming with nonlinear constrains to nonlinear programming without constrains in subfield of the ruld-field by the value of components of identifiable vector R in the sequence of interval L.The algorithm could be used to solve the problem of multiobjective programming based on maximum entropy principle.Both theory and numerical analysis show that this algorithm is stable and reliable.