Triangularity of the Basis in Linear Programs for Material Requirements Planning.

Abstract

It is shown that the basis in a class of linear programs arising from material requirements planning can be triangularized. This allows for efficient adaptation of the Simplex Method similar to those for network problems. It also suggests that for finite-loading (i.e. capacitated) MRP, a decomposition approach exploiting both subproblem structure and parallel processing can be effective for handling complex problems in multiproduct, multistage, multiperiod production systems. Keywords: Production and Operations management; Parallel processing.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1987
Accession Number
ADA191467

Entities

People

  • James K. Ho
  • William A. Mckenny

Organizations

  • University of Tennessee

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Assembly
  • Coefficients
  • Computers
  • Failure Mode And Effect Analysis
  • Inventory
  • Lead Time
  • Linear Programming
  • Manufacturing
  • Materials
  • Military Research
  • Operations Management
  • Parallel Computing
  • Parallel Processing
  • Parallel Processors
  • Production
  • Simplex Method

Fields of Study

  • Engineering

Readers

  • Industrial Economics
  • Operations Research