Nonlinear Integer Programming

Name: Nonlinear Integer Programming
Rating: 3 (1 reviews)

Duan Li · Xiaoling Sun

2006年8月 · International Series in Operations Research & Management Science 第 84 冊 · Springer Science & Business Media

3.0

1 則評論

電子書

438

頁數

評分和評論未經驗證瞭解詳情

關於這本電子書

It is not an exaggeration that much of what people devote in their hfe re solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieve ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer pro gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field.