Converting a Converging Algorithm into a Polynomially Bounded Algorithm

Abstract

This document considers a certain general Phase 1 linear programming problem with a convexity constraint which can be written after some algebraic manipulation in certain form.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1991
Accession Number
ADA234961

Entities

People

  • George Bernard Dantzig

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Convex Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Interdisciplinary Science
  • Iterations
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Operations Research
  • Polynomials
  • Sequences
  • Simplex Method
  • United States
  • United States Government