Return to search

Surrogate dual search in nonlinear integer programming.

Wang, Chongyu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 74-78). / Abstract also in Chinese. / Abstract --- p.1 / Abstract in Chinese --- p.3 / Acknowledgement --- p.4 / Contents --- p.5 / List of Tables --- p.7 / List of Figures --- p.8 / Chapter 1. --- Introduction --- p.9 / Chapter 2. --- Conventional Dynamic Programming --- p.15 / Chapter 2.1. --- Principle of optimality and decomposition --- p.15 / Chapter 2.2. --- Backward dynamic programming --- p.17 / Chapter 2.3. --- Forward dynamic programming --- p.20 / Chapter 2.4. --- Curse of dimensionality --- p.23 / Chapter 3. --- Surrogate Constraint Formulation --- p.26 / Chapter 3.1. --- Surrogate constraint formulation --- p.26 / Chapter 3.2. --- Singly constrained dynamic programming --- p.28 / Chapter 3.3. --- Surrogate dual search --- p.29 / Chapter 4. --- Distance Confined Path Algorithm --- p.34 / Chapter 4.1. --- Yen´ةs algorithm for the kth shortest path problem --- p.35 / Chapter 4.2. --- Application of Yen´ةs method to integer programming --- p.36 / Chapter 4.3. --- Distance confined path problem --- p.42 / Chapter 4.4. --- Application of distance confined path formulation to integer programming --- p.50 / Chapter 5. --- Convergent Surrogate Dual Search --- p.59 / Chapter 5.1. --- Algorithm for convergent surrogate dual search --- p.62 / Chapter 5.2. --- "Solution schemes for (Pμ{αk,αβ)) and f(x) = αk" --- p.63 / Chapter 5.3. --- Computational Results and Analysis --- p.68 / Chapter 6. --- Conclusions --- p.72 / Bibliography --- p.74

Identiferoai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_326804
Date January 2009
ContributorsWang, Chongyu., Chinese University of Hong Kong Graduate School. Division of Systems Engineering and Engineering Management.
Source SetsThe Chinese University of Hong Kong
LanguageEnglish, Chinese
Detected LanguageEnglish
TypeText, bibliography
Formatprint, 78 leaves : ill. ; 30 cm.
RightsUse 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.0234 seconds