AN ALGORITHM FOR SEPARABLE NONCONVEX PROGRAMMING PROBLEMS: NONLINEAR CONSTRAINTS.

Abstract

The paper extends the algorithm described in a previous report to problems in which the objective function and the constraint functions are the sums of functions of the various decision variables. The important feature of the algorithm is that the global solution to a problem will be found even if the objective function is not convex and the feasible region is not a convex set. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1969
Accession Number
AD0698018

Entities

People

  • Richard M. Soland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convex Sets
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics
  • Nonconvex Programming

Readers

  • Operations Research