On a Classification Theorem for Geometric Programming.

Abstract

A new classification theorem for geometric programming is developed using known duality Theorems of Duffin-Peterson-Zenner and two new Theorems. The first theorem is related to totally degenerate problems and the second deals with subconsistent problems which are unbounded, and thereby new results are derived for non-canonical programs. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1971
Accession Number
AD0726315

Entities

People

  • K. O. Kortanek
  • W. Gochet
  • Y. Smeets

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Classification
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Geometric Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.