Interval Coefficient Nonlinear Programming: Model And Solution

In classic optimization, the coefficients are crisp numbers. Because of the complexity and fragmentary of information, sometimes we can only obtain the range of the coefficients (interval numbers).The programming with interval coefficients is called interval programming. There are two kinds of interval programming, interval linear programming(ILP) and interval nonlinear programming(INP).This thesis discusses the general model of the latter. By research of ordering function, we present its penalty function method under certain condition.The thesis consists of three chapters. In chapter 1, we introduce some tundamental knowledge about interval numbers, fuzzy numbers, and the arithmetic of them. In chapter 2, we disscuss the method to ranking interval numbers, the method to comparing two interval numbers and the definiation of ordering function. In chapter 3, we introdnce nonlinear programming and the author's work in INP, including the solution to INP under certain conditions and the approximate solution under weak conditions.