Certificates of infeasibility via nonsmooth optimization

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper presents a certificate of infeasibility for finding such boxes by solving a linearly constrained nonsmooth optimization problem. Furthermore, the constructed certificate can be used to enlarge an exclusion box by solving a nonlinearly constrained nonsmooth optimization problem.

Cite

CITATION STYLE

APA

Fendl, H., Neumaier, A., & Schichl, H. (2017). Certificates of infeasibility via nonsmooth optimization. Journal of Global Optimization, 69(1), 157–182. https://doi.org/10.1007/s10898-016-0473-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free