Solving Geometric Programs Using GRG-Results and Comparisons

Abstract

This paper describes the performance of a general purpose GRG code for nonlinear programming in solving geometric programs. The main conclusions drawn from the experiments reported are: (1) GRG competes well with special purpose geometric programming codes in solving geometric programs and, (2) Standard Time, as defined by Colville, is an inadequate means of compensating for different computing environments while comparing optimization algorithms.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1976
Accession Number
ADA030688

Entities

People

  • Aditya Jain
  • L. S. Lasdon
  • M. Ratner

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Compilers
  • Computer Programming
  • Environment
  • Extrapolation
  • Geometric Programming
  • Military Research
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Security
  • Standards
  • United States
  • United States Government
  • Universities

Readers

  • Operations Research
  • Theoretical Analysis.