A PRODUCTION SMOOTHING PROBLEM

Abstract

A single item is to be produced over a given number of time periods to satisfy known future requirements while minimizing costs where the costs per unit for production, storage, and change in production rate are known functions of time. While such a problem can be solved by regular linear programming methods, the novel feature here is that the primal and dual problems are solved jointly by means of a rapid graphical method involving only intersections and rotations of straight lines. The underlying reason for this stems from a special property of the near 'square block triangular' nature of the coefficient matrix.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 06, 1955
Accession Number
AD0604623

Entities

People

  • George Bernard Dantzig
  • Selmer Johnson

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Coefficients
  • Computations
  • Computer Programming
  • Construction
  • Equations
  • Linear Programming
  • Microfiche
  • Notation
  • Production
  • Production Rate
  • Rotation
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Computer Vision.
  • Software Engineering