duals for classical inventory models via generalized geometric programming通过广义几何规划双刀经典库存模型.pdfVIP

JOURNAL OF APPLIED MATHEMATICS AND DECISION SCIENCES, 8(3), 191–200 c Copyright 2004, Lawrence Erlbaum Associates, Inc. Duals for Classical Inventory Models via Generalized Geometric Programming CARLTON H. SCOTT† University of California Irvine, Graduate School of Management, Irvine, California 92697 USA THOMAS R. JEFFERSON University of Florida, Gainesville, Warrington College of Business, Decision and In- formation Sciences Department, Gainesville, Florida 32611 USA SOHEILA JORJANI California State University San Marcos, College of Business, High Technology Man- agement Department, San Marcos, CA 92096 USA Abstract. Inventory problems generally have a structure that can be exploited for computational purposes. Here, we look at the duals of two seemingly unrelated inventory models that suggest an interesting duality between discrete time optimal control and optimization over an ordered sequence of variables. Concepts from conjugate duality and generalized geometric programming are used to establish the duality. Keywords: Inventory models, conjugate duality, generalized geometric programming. 1. Introduction Geometric Programming is now a well-established branch of optimization theory and has been instrumental in the solution of many nonlinear opti- mization problems occurring in such diverse areas as marketing, Balachan- dran and Gensch [1], water pollution management, Ecker and McNamara [4] production engineering, Petropoulos [8], transportation planning, Jef- ferson and Scott [9], and machine maintenance, Cheng [2]. Initially, geo- metric programming concerned itself with finite dimensional optimization problems where both the objectives and the constraints were in posynomial form (i.e. polynomial with positive coefficients). Subsequently the theory was extended by Peterson [7] to any fi