书目名称 | Mathematical Programming and Control Theory | 编辑 | B. D. Craven | 视频video | | 丛书名称 | Chapman and Hall Mathematics Series | 图书封面 |  | 描述 | In a mathematical programming problem, an optimum (maxi mum or minimum) of a function is sought, subject to con straints on the values of the variables. In the quarter century since G. B. Dantzig introduced the simplex method for linear programming, many real-world problems have been modelled in mathematical programming terms. Such problems often arise in economic planning - such as scheduling industrial production or transportation - but various other problems, such as the optimal control of an interplanetary rocket, are of similar kind. Often the problems involve nonlinear func tions, and so need methods more general than linear pro gramming. This book presents a unified theory of nonlinear mathe matical programming. The same methods and concepts apply equally to ‘nonlinear programming‘ problems with a finite number of variables, and to ‘optimal control‘ problems with e. g. a continuous curve (i. e. infinitely many variables). The underlying ideas of vector space, convex cone, and separating hyperplane are the same, whether the dimension is finite or infinite; and infinite dimension makes very little difference to the proofs. Duality theory - the various nonlinear generaliz | 出版日期 | Book 1978 | 关键词 | Linear Programming; algorithms; mathematical programming; network; optimal control; optimization; project | 版次 | 1 | doi | https://doi.org/10.1007/978-94-009-5796-1 | isbn_softcover | 978-0-412-15500-0 | isbn_ebook | 978-94-009-5796-1 | copyright | B. D. Craven 1978 |
The information of publication is updating
|
|