A convex programming approach to the multiple constraint inventory problem /

Bibliographic Details
Main Author:	Lamberson, Leonard R. (Author)
Corporate Authors:	United States. Office of Naval Research (sponsoring body.), Texas A & M Research Foundation
Format:	Book
Language:	English
Published:	[College Station, Tex.] : Department of Industrial Engineering, College of Engineering, Texas A & M University, 1968.
Series:	Technical report (Texas A & M University. Themis Optimization Research Program) ; no. 3.
Subjects:	Economic lot size > Mathematical models. Inventory control > Mathematical models. Convex programming. Mathematical optimization.

Description
Abstract:	The calculation of economic lot sizes with more than one constraint on the system is a recognized problem in inventory control theory. This paper presents a simplex like solution procedure. The algorithm as presented can be readily adapted to other constraints which may arise in a specific application. The essential conditions for application are that the nonlinear constraints and/or objective function be differentiable, convex functions.
Item Description:	"May 31, 1968." "Research conducted through the Texas A & M Research Foundation."
Physical Description:	50 leaves, 6 unnumbered leaves : illustrations ; 28 cm
Bibliography:	Includes bibliographical references (leaf 29).