Optimization Model for Aggregate Blending
- 1 September 1985
- journal article
- Published by American Society of Civil Engineers (ASCE) in Journal of Construction Engineering and Management
- Vol. 111 (3) , 216-230
- https://doi.org/10.1061/(asce)0733-9364(1985)111:3(216)
Abstract
An optimization model of aggregate blending is presented that considers gradation, cost, and design requirements and is applicable to the blending of any number of aggregates. The model is formulated as a quadratic programming problem that minimizes the mean deviation from midpoint specification limits, subject to constraints on the preceding requirements. The model is applied to a numerical aggregate blending problem. Sensitivity analysis is performed to show how the model can also be used to minimize cost or to provide a trade‐off between mean deviation and cost. Extensions of the model to accommodate special practical cases are examined.Keywords
This publication has 6 references indexed in Scilit:
- Computer experiments on quadratic programming algorithmsEuropean Journal of Operational Research, 1981
- Algorithm 431: A computer routine for quadratic and linear programming problems [H]Communications of the ACM, 1972
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965
- Mathematical Method for Blending AggregatesJournal of the Construction Division, 1964
- Blending Natural Earth Deposits for Least CostJournal of the Construction Division, 1961
- The Simplex Method for Quadratic ProgrammingEconometrica, 1959