DECOMPOSITION PROGRAMMING AND ECONOMIC PLANNING

Abstract

The class of mathematical programming problems whose range is in euclidian n-space but whose domain is an abstract space is considered. A duality theory is presented that relates the constrained maximization problem considered as a function of its right-hand side to the associated Lagrangian maximization problem considered as a function of the Lagrange multipliers. The analysis leads to useful computational procedures.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1967
Accession Number
AD0667245

Entities

People

  • Stephen P. Bradley

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Programming
  • Contracts
  • Convex Programming
  • Convex Sets
  • Dynamic Programming
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • New York
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Simplex Method
  • Topology
  • United States

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Statistical inference.

Technology Areas

  • Space