Coal blending optimization under uncertainty
Article Abstract:
The decision problems associated with coal blending under uncertain conditions was characterized via a multi-objective chance-constrained programming model. The model represented sulphur content, ash content and heating value as normally distributed random variables and treated the coal purchasing cost, ash disposal cost, sulphur removal cost and fuel switching costs as the cost objective function. The problem was then reformulated as a mixed integer nonlinear programming problem to facilitate its application.
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:
Goal programming and data envelopment analysis (GoDEA) for target-based multi-level planning: allocating central grants to the Greek local authorities
Article Abstract:
The use of goal programming and data envelopment analysis for unifying the tasks of resource allocation and target setting in multi-unit, multi-level planning is examined. Specifically, the two techniques are incorporated into a model that supports a link between resource allocation and performance targets of individual decision-making units and that incorporates decision-makers' preferences. It was implemented as a group decision support system for the budget planning needs of Greek local authorities.
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:
On solving a variation of the assignment problem
Article Abstract:
A new algorithm for solving S. Geetha and K.P.K. Nair's proposed variant of the n-by-n bottleneck assignment problem is introduced. The procedure is based on the application of M.L. Balinski's signature method or dual simplex method to the assignment problem at each stage. Unlike Geetha and Nair's O(n5) algorithm, it is simpler, having a complexity of 'O m(m + n log n)' where m is the number of arcs.
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: Modeling and solving a real-life assignment problem at universities. Performance assessment in higher education inn Britain
- Abstracts: On solving large instances of the capacitated facility location problem. Column generation applied to linear programs in course registration
- Abstracts: Realising the autonomous house. A celebration of domestic life. The challenge of rescuing a romantic Welsh ruin
- Abstracts: Malaysia will soon commence carving a high-tech capital out of the palms. Indonesia to offer shares in lean, improved Tima
- Abstracts: Emphasis on shorter-dated debt reflects uncertainty over colony's rating in '97. Nan Ya is recommended as a buy after steep fall