An Introduction to Geometric Programming,

Abstract

Geometric Programming (GP) can solve two types of problems: non-linear minimization formulations and simultaneous are non-linear, there are numerous potential applications. Furthermore, GP can provide the general solution to a given non-linear problem if the problem is reduced to what is called zero degrees of difficulty. Sample solutions to some problems are provided. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1984
Accession Number
ADP002962

Entities

People

  • D. W. Baker
  • P. D. Allen

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Cooperation
  • Evolutionary Algorithms
  • Geometric Programming
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Operations Research

Fields of Study

  • Mathematics

Readers

  • Operations Research

Technology Areas

  • Space