Accession Number:

AD0673422

Title:

A CONVEX PROGRAMMING APPROACH TO THE MULTIPLE CONSTRAINT INVENTORY PROBLEM.

Descriptive Note:

Themis optimization research program,

Corporate Author:

TEXAS A AND M UNIV COLLEGE STATION DEPT OF INDUSTRIAL ENGINEERING

Personal Author(s):

Report Date:

1968-05-31

Pagination or Media Count:

54.0

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 andor objective function be differentiable, convex functions. Author

Subject Categories:

  • Operations Research
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE