Primal Geometric Programs Treated by Linear Programming.

Abstract

Necessary and sufficient optimality conditions, requiring no constraint qualifications, are given in terms of associated linear programs which also serve in the characterization of, and the reduction to, canonical programs. An iterative method for solving superconsistent geometric programs, based on the above conditions, is described.

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1974
Accession Number
ADA005902

Entities

People

  • Adi Ben-israel
  • Aharon Ben-tal

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Engineering
  • Industrial Engineering
  • Linear Programming
  • Mathematics
  • Operations Research
  • Systems Engineering

Fields of Study

  • Physics

Readers

  • Operations Research