Perfect aggregation and disaggregation of complementarity problems

Paris, Q.

Perfect aggregation and disaggregation of complementarity problems

1980

Paris, Q.

Extract: Perfect aggregation of linear complementarity problems is possible under the notion of constrained consistency. This notion - which also can be interpreted as a disaggregation rule - requires restrictions on the domain of the microvariables to be aggregated. The linear complementarity problem includes symmetric and asymmetric quadratic programming, linear programming, and two-person, nonzero-sum games. Hence, all these mathematical programming structures admit consistent aggregation and disaggregation of their primal and dual variables.

显示更多 [+]