A CONVEX PROGRAMMING APPROACH TO THE MULTIPLE CONSTRAINT INVENTORY PROBLEM.

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. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 31, 1968
Accession Number
AD0673422

Entities

People

  • Leonard R. Lamberson

Organizations

  • Texas A&M University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Control Theory
  • Convex Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Inventory
  • Inventory Control
  • Mathematics
  • Optimization

Readers

  • Operations Research