Advertisement

Decomposition

  • Sven Danø

Abstract

The structure of a linear programming problem may be such that it can be decomposed into independent subproblems which can be solved separately.

Keywords

Capacity Factor Central Authority Shadow Price Slack Variable Total Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag/Wien 1974

Authors and Affiliations

  • Sven Danø
    • 1
  1. 1.University of CopenhagenDenmark

Personalised recommendations