A Composite Algorithm for Mixed Integer Constrained Nonlinear Optimization.

Abstract

A composite optimization algorithm applicable to mixed integer, constrained, nonlinear problems is developed in this research. One major component of the composite algorithm is a modified version of the nonlinear simplex method. Significant modifications are made to this algorithm including the incorporation of a unidimensional search procedure and the use of a new method to treat constraints. Additional features of the composite algorithm include new acceleration strategies, a new decomposition approach, and a discrete grid algorithm. The components of the composite algorithm are tested on problems primarily selected to represent engineering design optimization applications. The performance of the new methods is compared to some existing techniques. Examples of the application of combinations of the composite components are included. The results indicate that the new algorithms obtain superior solutions and in most cases are more efficient than existing techniques.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1980
Accession Number
ADA092435

Entities

People

  • Daniel B. Fox

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computer Programs
  • Dynamic Programming
  • Engineering
  • Evolutionary Algorithms
  • Failure Mode And Effect Analysis
  • Industrial Engineering
  • Linear Programming
  • Mathematical Programming
  • Mechanical Engineering
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Plastic Explosives
  • Simplex Method
  • Systems Engineering

Readers

  • Operations Research
  • Reinforced Composite Materials