A continuous time,deterministic, nonstationary model of economic ordering |
| |
Affiliation: | 1. Department of Electrical Engineering and Automation, Aalto University, Espoo, Finland;2. Department of Electrical Engineering, Center of Excellence in Power System Control and Management, Sharif University of Technology, Tehran, Iran;1. University of Zagreb, Faculty of Electrical Engineering and Computing, Unska 3, HR-10000 Zagreb, Croatia;2. GULIN Automation and Control Ltd., Put kroz Meterize 33, HR-22000 Šibenik, Croatia;1. Economic & Technology Research Institute, State Grid Shandong Electric Power Company, Jinan 250021, Shandong Province, PR China;2. Key Laboratory of Power System Intelligent Dispatch and Control of Ministry of Education, Shandong University, Jinan 250061, Shandong Province, PR China;3. Global Energy Interconnection Group Co., Ltd., Xicheng District, 100031 Beijing, PR China;1. Dept. Computing, Imperial College London, London, UK;2. Dept Computer Science and AI, Universidad de Granada, Granada, Spain |
| |
Abstract: | The paper considers the problem of economic ordering for a deterministic, nonstationary environment in continuous time. Previous work on the topic is reviewed. The specification of the cost criterion common in inventory theory is called in question for nonstationary situations as far as interest cost is concerned. It is proposed to account for interest by discounting rather than in a holding cost expression. The main interest of the paper is in three versions of the problem: First an unconstrained version, for which inventory is allowed to become negative (backlogging model), second a model in which inventory is constrained to be nonnegative (non-backlogging model), and third a nonbacklogging model with a storage space constraint. For the first two problems necessary optimality conditions are derived which are based on control theory for continuous time systems with jumps in the state trajectories, especially on Blaquière's impulsive maximum principle. These conditions reduce the problem of finding an optimal ordering plan, i.e. an unknown number of optimal ordering times and for each of them an optimal order size to a one parameter search problem. Due to the possibility of multiple solutions of the optimality conditions for each ordering time, one cannot in general identify a unique candidate ordering plan for each value of the search parameter, but only a tree-structured set of such plans. The optimality conditions for the first two problem versions and for a fourth one with a storage space constraint but without a non-backlogging constraint are eventually combined to yield a solution of the storage space constrained non-backlogging version. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|