A Compound Scaling Algorithm for Mathematical Optimization

Abstract

This paper derives a compound scaling algorithm from a single scaling algorithm for use with general mathematical optimization problems. Compound scaling is necessary when the constraints are nonlinear and the variables do not all belong to the active set. Compound scaling in conjunction with the optimality criteria method has practical applications in large scaled multidisciplinary design. It will extend the scope of the optimality criteria method to handle problems with thousands of variables and constraints. The development of simple scaling is included as a basis for the development of the compound scaling algorithm. Five problems were selected to demonstrate the effectiveness of the simple and compound scaling algorithms.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1989
Accession Number
ADA208446

Entities

People

  • Victoria A. Tischler
  • Vipperla B. Venkayya

Organizations

  • Wright Laboratory

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Air Force Facilities
  • Algorithms
  • Boundaries
  • Classification
  • Engineering
  • Evolutionary Algorithms
  • Governments
  • Inequalities
  • Margin Of Safety
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming
  • Observation
  • Optimization
  • United States

Readers

  • Computational Modeling and Simulation
  • Operations Research
  • Quantum Chemistry