On the Feasibility of a Generalized Linear Program

Abstract

The first algorithm for solving generalized linear programs was given by Dantzig. His algorithm assumes that a basic feasible solution of the generalized program to be solved exists and is given. If the initial basic feasible solution is non-degenerate, then his algorithm is guaranteed to converge. The purpose of this paper is to show how to find an initial basic feasible (possibly degenerate) solution of a generalized linear program by applying the same algorithm to a phase-one problem without requiring that the initial basic feasible solution to the latter be non-degenerate.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1989
Accession Number
ADA207402

Entities

People

  • Hui Hu

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convex Sets
  • Heuristic Methods
  • Linear Programming
  • Military Research
  • Numbers
  • Operations Research
  • Optimization
  • Real Numbers
  • Sequences
  • Simplex Method
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research