SELECTING DIFFERENT DROPPING VARIABLES IN THE SIMPLEX ALGORITHM.

Abstract

At any interaction (after the first) of the simplex algorithm, it may be possible to secure additional objective function decrease by making basic the variable which left the basis at the last iteration, we well as the one chosen by the usual criterion. In solving linear programs on a computer, this decrease can be obtained without the time-consuming searching of external memory required to perform a complete iteration. The report presents tests for determining when such a procedure will be beneficial, describes an algorithm incorporating these ideas, and summarizes computational results for some sample problems. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1968
Accession Number
AD0702045

Entities

People

  • Robert B. Gordon

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Contracts
  • Evolutionary Algorithms
  • Heuristic Methods
  • Iterations
  • Linear Programming
  • Mathematics
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Systems Analysis and Design