Inscribing and Circumscribing Convex Polyhedra.

Abstract

Let X and Y be closed polyhedral convex sets, bounded or not, in R superscript n. For certain representations of X and Y it is shown that the task of finding the smallest scale of X for which some translate contains Y can be resolved with linear programming. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1979
Accession Number
ADA069290

Entities

People

  • B. Curtis Eaves
  • R. M. Freund

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • California
  • Computer Programming
  • Convex Sets
  • Linear Programming
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • Operations Research
  • Theorems
  • Translations

Fields of Study

  • Mathematics

Readers

  • Computational Fluid Dynamics (CFD)
  • Graph Algorithms and Convex Optimization.