Solving Geometric Programs Using GRG-Results and Comparisons

reportActive / Technical Report | Accession Number: ADA030688 | Open PDF

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.

Author(s):
Ratner, M. ; Lasdon, L. S. ; Jain, A.
Author Organization(s):
STANFORD UNIV CA SYSTEMS OPTIMIZATION LAB
Descriptive Note:
Technical rept.
Pagination:
0023

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release; Distribution Is Unlimited.

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
SOL-76-1
Contract/Grant Number(s):
N00014-75-C-0267, N00014-75-C-0865
Project Number(s):
NR-047-064, NR-047-143
 Subject Terms
Joint Capability Areas:
JCA_5.3_Planning; JCA_5_Command and Control; JCA_1.2_Force Preparation; JCA_1_Force Support; JCA_1.2.3_Educating; JCA_1.2.7_Experimentation
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*NONLINEAR PROGRAMMING, PROBLEM SOLVING, EXECUTIVE ROUTINES, GEOMETRY, ALGORITHMS, FORTRAN
Field(s)/Group(s):
Operations Research, Computer Programming and Software
Keyword(s):
GEOMETRIC PROGRAMMING
Report Date:
1976 May 01