Solving Singularly Constrained Generalized Network Problems.

Abstract

The singularly constrained generalized network problem represents a large class of capacitated linear programming (LP) problems. This class includes any LP problem whose coefficient matrix, ignoring single upper bound constraints, contains m + 1 rows which may be ordered such that each column has at most two non-zero entries in the first m rows. The paper describes efficient procedures for solving such problems and presents computational results which indicate that procedures are at least five times faster than the state of the art LP systems MPS-360 and Apex-3.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1976
Accession Number
ADA035917

Entities

People

  • Darwin Dee Klingman
  • John Hultz

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Coefficients
  • Computer Programming
  • Computing-Related Activities
  • Contract Administration
  • Contracts
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Operations Research