碳排放权和其他生产投入类似,是很像大宗商品投入的生产要素。然而,参与碳交易的公司只需要在某个时间,比如一年的结尾实现碳排放权限的减量。碳排放的另一个重要特点是不可忽略的固定交易成本。本文试图揭示参与碳交易的企业应该如何优化协调其生产以及碳排放权的采购决策,以尽量减少其在长期成本。在每个阶段,该公司基于已有的排放权,波动的市场价格和库存水平决定其排放权的购买数量和生产量。我们给出了最优的联合决策结构特征: 最优排放权采购欢是状态依赖型的(s,S)型决策。生产决策基本上是状态依赖型的基库守存决策。分解的启发式计算被发现是有效的计算研究。我们解决方法是定义一类具有一类性质的二维的函数,在一个维度上定义类似K-凸函数的性质,并在另一个维度上定义类似凸函数的性质。 / The trading of emissions permits, as an effective market-based approach for emissions control, is becoming widespread over the world. Similar to any other production input, the emissions permit is a factor of production much like commodity inputs. However, a firm participating in emissions trading has only to balance its permits at the end of a time horizon, say one year. Another key feature of permit trading is the existence of non-negligible, fixed, transaction costs. This paper attempts to shed light on how such a firm should optimally coordinate its production and permit purchasing decisions in order to minimize its total cost in the long run. In each period, the firm has to decide on its permit purchase quantities and production levels based on its on-hand permit and inventory levels as well as the market-prevalent permit price. The latter evolves as a Markov process and the firm also faces random demand. We characterize the optimal joint policy structure: an optimal purchase policy is of the state-dependent (s, S) type and an optimal production decision nearly follows a state-dependent base-stock form. A heuristic based on decomposition is found to be effective from computational studies. Our enabling technique is the identification of a class of two-dimensional functions that in one dimension it looks like K-convex and in another it is similar to convex. / Detailed summary in vernacular field only. / Yuan, Quan. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 74-84). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese. / Abstract --- p.i / Abstract in Chinese --- p.ii / Acknowledgements --- p.iii / Contents --- p.vi / List of Tables --- p.viii / List of Figures --- p.ix / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Purpose of the Work --- p.3 / Chapter 1.3 --- Structure of the Work --- p.4 / Chapter 2 --- Literature Review --- p.6 / Chapter 3 --- Formulations --- p.10 / Chapter 4 --- A New Class of K-convex Functions --- p.13 / Chapter 4.1 --- A Class of K-Convex Functions --- p.13 / Chapter 4.1 --- Convex Functions --- p.13 / Chapter 4.1.2 --- K-convex Functions in R¹ or Z¹ --- p.15 / Chapter 4.1.3 --- K-convex Functions in R[superscript n] or Z[superscript n] --- p.18 / Chapter 4.1.4 --- C²(K) Functions --- p.19 / Chapter 4.2 --- Z¹ Policies --- p.24 / Chapter 4.3 --- Appendix of Chapter 4 --- p.27 / Chapter 5 --- Optimal Policy --- p.43 / Chapter 5.1 --- A Transformation --- p.43 / Chapter 5.2 --- Policy Characterization --- p.44 / Chapter 5.3 --- Appendix of Chapter 5 --- p.48 / Chapter 6 --- Heuristic and Lower Bound --- p.57 / Chapter 7 --- Numerical Study --- p.61 / Chapter 7.1 --- Parameter Setups --- p.61 / Chapter 7.2 --- Non-monotone Trends in Optimal Policy --- p.63 / Chapter 7.3 --- Heuristic Performance --- p.65 / Chapter 8 --- Concluding Remarks --- p.72 / Bibliography --- p.74
Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_328176 |
Date | January 2012 |
Contributors | Yuan, Quan, 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 | electronic resource, electronic resource, remote, 1 online resource (x, 84 leaves) : ill. (some col.) |
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.0023 seconds