The Facial Decomposition Method

Abstract

The note presents a brute force approach to linearly constrained programming in non-convex optimization; the aim here is to illustrate a general methodology which can be applied to construct tailor-made algorithms in specific applications. In essence, the facila decomposition method constructs a non- redundant list of all faces of the polyhedral set P belongs to (R sup n). Each face is characterized by a linear program in a given affine subspace of R sup n. This list is conveniently displayed in a tree structure which represents the set of nodes to be searched (typically for optimality).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1972
Accession Number
AD0743266

Entities

People

  • Claude-alain Burdet

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Construction
  • Convex Programming
  • Decomposition
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Monitoring
  • Optimization
  • Pennsylvania
  • Quadratic Programming
  • Schools
  • Universities

Readers

  • Operations Research
  • Systems Analysis and Design

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms