MINIMIZING A CONCAVE FUNCTION IN A CONVEX POLYTOPE.

Abstract

An algorithm is suggested for minimizing a concave function subject to linear constraints. The algorithm is very much like the Simplex Method except additional constraints are generated during the computation. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1969
Accession Number
AD0707790

Entities

People

  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Mathematical Analysis
  • Simplex Method

Readers

  • Operations Research