Gao Jianjun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 75-76). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Solution Framework Using Dynamic Programming --- p.7 / Chapter 2.1 --- Difficulty of using dynamic programming --- p.8 / Chapter 2.2 --- Scalar-state problems --- p.12 / Chapter 2.3 --- Time-invariant system --- p.17 / Chapter 2.4 --- Illustrative example of a scalar-state problem --- p.21 / Chapter 3 --- Cardinality Constrained Quadratic Optimization --- p.26 / Chapter 3.1 --- Reformulation --- p.27 / Chapter 3.2 --- NP hardness --- p.31 / Chapter 3.3 --- Solving CCQP with an efficient branch and bound method --- p.34 / Chapter 3.3.1 --- Efficient branch and bound algorithm --- p.34 / Chapter 3.3.2 --- Geometrical interpretation of the proposed ranking order --- p.48 / Chapter 3.3.3 --- Additional algorithmic ideas for enhancing computational efficiency --- p.56 / Chapter 3.4 --- Numerical example and computational results --- p.60 / Chapter 4 --- Summary and Future Work --- p.73
Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_325380 |
Date | January 2005 |
Contributors | Gao, Jianjun, Chinese University of Hong Kong Graduate School. Division of Systems Engineering and Engineering Management. |
Source Sets | The Chinese University of Hong Kong |
Language | English, Chinese |
Detected Language | English |
Type | Text, bibliography |
Format | print, v, 76 leaves : ill. ; 30 cm. |
Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0026 seconds