A nonlinear interval number programming method for uncertain optimization problems

摘要

In this paper, a method is suggested to solve the nonlinear interval number programming problem with uncertain coefficients both in nonlinear objective function and nonlinear constraints. Based on an order relation of interval number, the uncertain objective function is transformed into two deterministic objective functions, in which the robustness of design is considered. Through a modified possibility degree, the uncertain inequality and equality constraints are changed to deterministic inequality constraints. The two objective functions are converted into a single-objective problem through the linear combination method, and the deterministic inequality constraints are treated with the penalty function method. The intergeneration projection genetic algorithm is employed to solve the finally obtained deterministic and non-constraint optimization problem. Two numerical examples are investigated to demonstrate the effectiveness of the present method. (C) 2007 Elsevier B.V. All rights reserved.