THE DUALPLEX METHOD FOR LARGE-SCALE LINEAR PROGRAMS.

Abstract

In Chapter II the author describes the dualplex algorithm as it applies to the general linear programming problem with the structure b = IW + AX + BY. The necessary proofs and formulas are given, along with a summary of the method and a numerical example. Chapter III describes how the algorithm would be applied to a 2-stage problem and then its extension to a general t-stage problem. A summary of the t-stage algorithm is given and a 2-stage numerical example is solved. Chapter IV represents specialization of the dualplex method to the bounded linear-programming problem, the generalized bounded problem, and the transportation problem and related systems. In each case, a new and efficient algorithm is developed. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1966
Accession Number
AD0635497

Entities

People

  • Saul I. Gass

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method
  • Specialization
  • Transportation

Fields of Study

  • Mathematics

Readers

  • Business Analytics
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Military Science