ASYMPTOTIC DUALITY OVER CLOSED CONVEX SETS.

Abstract

The asymptotic duality theory of linear programming over closed convex cones is extended to closed convex sets, by embedding such sets in appropriate cones. Applications to convex programming and to approximation theory are given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 30, 1969
Accession Number
AD0711651

Entities

People

  • A. Ben-israel
  • Abraham Charnes
  • K. O. Kortanek

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algebra
  • Applied Mathematics
  • Computer Programming
  • Contracts
  • Convex Programming
  • Convex Sets
  • Embedding
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research