Nonlinear Programming Global Optimization Techniques.

Abstract

A computer-implementable algorithm for obtaining the global solution of finite-dimensional nonlinear programming problems with functions given in explicit factorable form has been developed and validated. The necessary subalgorithms for obtaining convex envelopes of standard functions of a single variable and global solutions to polynomials of one variable have been partially explored. Preliminary investigations into the solution of optimization problems with an infinite number of constraints whose function values are given implicitly has been successful. Application has been made of nonconvex programming theory to the solution of two-person zero-sum sequential games. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1974
Accession Number
AD0784918

Entities

People

  • Anthony V. Fiacco
  • Garth Philip McCormick
  • James E. Falk

Organizations

  • George Washington University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Nonconvex Programming
  • Nonlinear Programming
  • Optimization
  • Polynomials
  • Sequential Games
  • Standards

Fields of Study

  • Mathematics

Readers

  • Game Theory.
  • Operations Research