A new aggregation-disaggregation algorithm
Article Abstract:
A new two-stage procedure for obtaining the equilibrium distribution of large Markov chains is introduced. The first stage renders the Markov chain decomposable via the optimal division of states into blocks. This requires an objective function for analyzing the Markov chain's decomposability with respect to a partition. To this end, a lower bound for the objective function is introduced an a branch-and-bound algorithm for deriving the optimal partition which yields the minimum of the objective function. The latter enables the application of the aggregation-disaggregation method for solving the Kolmogoroff equations.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
The capacitated plant location problem
Article Abstract:
Several solutions to the capacitated plant location problem (CPLP) commonly encountered by operations managers and researchers are evaluated. These include heuristic-based schemes, the dual ascent method and the linear programming relaxation approach. Results indicate that all methods provide accurate solutions to the CPLP.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An application of genetic algorithms for flow shop problems. A primal partitioning approach for single and non-simultaneous multicommodity flow problems
- Abstracts: An efficient transformation of the generalized vehicle routing problem. On a cutting plane heuristic for the stable roommates problem and its applications
- Abstracts: Group preference aggregation with the AHP -implications for multiple-issue agendas. Dimension of valued relations