Concave Minimization via Collapsing Polytopes.

Abstract

The global minimization of a concave function over a (bonded) polytope is accomplished by successively minimizing the function over polytopes containing the feasible region, and collapsing to the feasible region. The initial containing polytope is a simplex, and, at the kth iteration, the most promising vertex of the current containing polytope is chosen to refine the approximation. A tree whose ultimate terminal nodes coincide with the vertices of the feasible region is generated, and accounts for the vertices of the containing polytopes. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 16, 1980
Accession Number
ADA118126

Entities

People

  • James E. Falk
  • Karla L. Hoffman

Organizations

  • George Washington University

Tags

Communities of Interest

  • Air Platforms
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Facilities
  • Algorithms
  • Computations
  • Demographic Cohorts
  • Engineering
  • Iterations
  • Linear Programming
  • Military Research
  • National Security
  • Operations Research
  • Plastic Explosives
  • Schools
  • Sequences
  • Systems Engineering
  • Terminals
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.
  • Software Engineering