Converting General Nonlinear Programming Problems to Separable Nonlinear Programming Problems

Abstract

It is shown that with the introduction of additional variables and equality constraints most general nonlinear optimization problems can be converted to separable problems. Local solutions are preserved as well as first and second-order Kuhn-Tucker conditions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 16, 1972
Accession Number
AD0746126

Entities

People

  • Garth Philip McCormick

Organizations

  • George Washington University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computer Programming
  • Computer Programs
  • Computers
  • Contracts
  • Engineering
  • Heuristic Methods
  • Logistics
  • Military Research
  • Nonlinear Programming
  • Optimization
  • Security
  • Supply Chain Management
  • Universities

Readers

  • Operations Research