My bibliography  Save this paper

# Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme[A General Decomposition Algorithm for Linear Optimization Problems]

## Author

Listed:
• Heinemann, Hergen H.

## Abstract

A Really GENERAL Decomposition Algorithm for Very Large Linear Optimization Problems Proven theory as Regards Optimality and Finality Advantageous for very large problems with a rather small percentage of real variables in the optimal solution - Simplex method is used as a calculating sub-routine - NO SPECIAL STRUCTURE OF MATRIX REQUIRED - Method applicable without change for non-structures as well as for any and all structures of matrix. Maximum necessary problem size to be calculated with simplex method procedure: a bit more than a matrix of optimal-solution original variables and optimal solution restrictions - single-stage or double-stage decomposition possible - parametric-programming-similar re-calculations possible. For consultancy on slight extensions in theory as well as on important extensions in calculation tactics you may contact Dr. Hergen Heinemann: Hergen.Heinemann"et"alumni.insead.edu Detailed ABSTRACT of Theory (1) From the total problem matrix (TPM) partial problems (PP) are taken arbitrarily, but every variable should be represented in at least one of them. (2) PPA´s are equipped with suitable functions for optimization and are optimized with the simplex method procedure. (3) The optimized solutions of the PPA´s serve to obtain variables for an auxiliary problem (AP), which is then optimized to reflect an optimal combination of the optimized PP`s. (4) With the optimal dual values of the AP the actual values for every variable of the to-be-optimized function of the TPM are calculated. (5) With the actual values for every variable of the to-be-optimized function of the TPM a test is done to check whether the optimal solution of the TPM is already reached. (6) Is the optimum solution of the TPM reached, then the algorithm is at the end. If not, the algorithm continues with item (2) above with a new set of variables and using the actual values of the variables of the to-be-optimized function as per item (3), starting a new cycle of the algorithm. Original copy may be available at: Titel: Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme (in English: A General Decomposition Algorithm for Linear Optimization Problems) ( To obtain a copy of this operations research on linear programming paper e-mail to Technische Universitaet, Braunschweig:) fernleihe@tu-bs.de Author: Heinemann, Hergen Published: 1971 No. of pages: III, 80 S. ; 8º Doctoral Degree Paper: Saarbruecken, University, Diss., 1971 Signature: 2400-3106 / Tiefmagazin, 2. UG

## Suggested Citation

• Heinemann, Hergen H., 1971. "Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme
[A General Decomposition Algorithm for Linear Optimization Problems]
," MPRA Paper 28842, University Library of Munich, Germany.
• Handle: RePEc:pra:mprapa:28842
as

File URL: https://mpra.ub.uni-muenchen.de/28842/3/MPRA_paper_28842.pdf
File Function: original version

## References listed on IDEAS

as
1. Shailendra C. Parikh & William S. Jewell, 1965. "Decomposition of Project Networks," Management Science, INFORMS, vol. 11(3), pages 444-459, January.
Full references (including those not matched with items on IDEAS)

### Keywords

general decomposition algorithm; allgemeiner Dekompositionsalgorithmus; linear optimization problems; lineare Optimierungsprobleme; Dekomposition; linear programming; lineare Programmierung; Operations Research; very large linear optimizationproblems; Dekompositionsalgorithmus fuer lineare Optimierungsprobleme; Dr. Hergen Heinemann; Endlichkeitsbeweis; optimality; finality; Optimalitätsbeweis;

### JEL classification:

• C65 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Miscellaneous Mathematical Tools
• C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
• C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

## Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:28842. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter). General contact details of provider: http://edirc.repec.org/data/vfmunde.html .

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.