The Solution of Manpower Planning Problems by the Forward Simplex Method.

Abstract

The use of the forward simplex algorithm of Aronson, Morton, and Thompson to solve the multi-stage personnel planning linear programming models of Charnes, Cooper, and Niehaus is described. Computational Results on randomly generated problems having up to 200 periods indicate that the forward simplex method requires CPU time and number of pivots which are linear in the number of periods. The standard simplex method requirements vary with at least the cube of the number of periods. For this reason the forward simplex method should be especially useful for solving real-time, conversational versions of personnel (and other) planning models. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1980
Accession Number
ADA091521

Entities

People

  • Gerald L. Thompson
  • Jay E. Aronson

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computations
  • Computer Programming
  • Data Sets
  • Decomposition
  • Economic Systems
  • Engineering
  • Evolutionary Algorithms
  • Goal Programming
  • Heuristic Methods
  • Interdisciplinary Science
  • Linear Programming
  • Manpower
  • Simplex Method
  • Standards
  • Universities

Readers

  • Operations Research