arXiv Analytics

Sign in

arXiv:2208.13445 [math.OC]AbstractReferencesReviewsResources

On the Relation Between Affinely Adjustable Robust Linear Complementarity and Mixed-Integer Linear Feasibility Problems

Christian Biefel, Martin Schmidt

Published 2022-08-29Version 1

We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an adjustable robust solution of a given linear complementarity problem is equivalent to solving a properly chosen mixed-integer linear feasibility problem.

Related articles:
arXiv:2008.05784 [math.OC] (Published 2020-08-13)
Affinely Adjustable Robust Linear Complementarity Problems