PRODuCTION PLANNING WITH CONVEX COSTS: A PARAMETRIC STUDY

Abstract

This study is concerned with the problem of choosing the amounts x sub 1, x sub 2,..., x sub n of a single product (or aggregation of several products) to produce in each of n successive time periods 1,2,...,n so as to minimize the total manufacturing costs over the n periods. The requirements r sub 1, r sub 2,..., r sub n for the product occurring in periods 1,2,...,n are assumed to be known in advance. Requirements in a period are satisfied in so far as possible from stock on hand at the beginning of the period and from production during the period. Requirements which cannot be met in this was are back logged until they can be satisfied by subsequent production.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 22, 1963
Accession Number
AD0407040

Entities

People

  • Arthur F. Veinott

Organizations

  • Stanford University

Tags

Communities of Interest

  • Ground and Sea Platforms
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Facilities
  • Algorithms
  • Applied Mathematics
  • California
  • Computations
  • Contracts
  • Engineering
  • Government Procurement
  • Materials
  • Mathematics
  • New Jersey
  • New York
  • Procurement
  • Quality Control
  • Real Numbers
  • United States

Readers

  • Industrial Economics
  • Mathematics or Statistics
  • Operations Research