Aggregating linear complementarity problems under a general definition of constrained consistency leads to the possibility of consistent aggregation of linear and quadratic programming models. Under this formulation, consistent aggregation of dual variables is also achieved. Furthermore, the existence of multiple sets of aggregation operators is illustrated with a numerical example. Such multiple operators allow considerable flexibility of the microstructures admitting consistent aggregation.