id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_fp3i33dllna4nhahi6vk6dmtom	Carlton Scott	Duals for Classical Inventory Models via Generalized Geometric Programming	2004	10	.pdf	application/pdf	2783	436	75	Keywords: Inventory models, conjugate duality, generalized geometric programming. theory and has been instrumental in the solution of many nonlinear optimization problems occurring in such diverse areas as marketing, Balachandran and Gensch [1], water pollution management, Ecker and McNamara [4] production engineering, Petropoulos [8], transportation planning, Jefferson and Scott [9], and machine maintenance, Cheng [2]. The dual problem, taken in the geometric programming sense (i) the dual problem is optimized over the polar to the cone constraints (ii) the constraints in the primal problem are absorbed into the dual objective function. In this way, while the primal program may have nonlinear constraints, the dual may be simply an optimization over a polyhedral set. means a finite dimensional convex programming problem with the constraint set being a cone. this case, the minimal cost is 20798.15 with optimal dual variables ν = and the geometric dual is a discrete time optimal control problem.	./cache/work_fp3i33dllna4nhahi6vk6dmtom.pdf	./txt/work_fp3i33dllna4nhahi6vk6dmtom.txt