NOTES ON OPERATIONS RESEARCH-2

Abstract

1) Geometric Interpretation of Dantzig's Convex Programming Algorithm. 2) The Problem of the Maximum Flow in Transportation with Corresponding Constraints. 3) A Technique for Resolving Degeneracy in Linear Programming.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 27, 1963
Accession Number
AD0434782

Entities

People

  • A. Ghouila-houri
  • Ellis Johnson
  • Philip Wolfe
  • Pierre Huard

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • California
  • Convex Programming
  • Equations
  • Flow Network
  • Government Procurement
  • Linear Programming
  • Mathematics
  • Military Research
  • Navy
  • New Jersey
  • New York
  • Operations Research
  • Optimization
  • Simplex Method
  • United States