Solving Constrained Generalized Network Problems.

Abstract

A constrained generalized network problem is a linear programming problem in which the coefficient matrix contains m + q rows which are ordered such that each column has at most two non-zero entries in the first m rows. This paper describes highly efficient ways to modify and implement the steps of the simplex algorithm for such problems. The efficiency is the direct result of exploiting the generalized network portion (first m rows) of the coefficient matrix.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1976
Accession Number
ADA035918

Entities

People

  • Darwin Dee Klingman
  • John Hultz

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computer Programming
  • Contracts
  • Efficiency
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Operations Research