Consistent Aggregation of Linear Complementarity Problems

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.


Issue Date:
1978
Publication Type:
Working or Discussion Paper
Record Identifier:
http://ageconsearch.umn.edu/record/225634
PURL Identifier:
http://purl.umn.edu/225634
Total Pages:
15
Series Statement:
78-1




 Record created 2017-04-01, last modified 2018-01-23

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)