Polyhedral analysis and branch-and-cut for the structural analysis problem

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential-algebraic system, in verifying if the system is structurally solvable for every state, and if not in finding a state in which the system is structurally singular. In this paper we study this problem from a polyhedral point of view. We identify some classes of valid inequalities and characterize when these inequalities define facets for the associated polytope. Moreover, we devise separation routines for these inequalities. Based on this, we develop a Branch-and-Cut algorithm and present some experimental results. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Lacroix, M., Mahjoub, A. R., & Martin, S. (2012). Polyhedral analysis and branch-and-cut for the structural analysis problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7422 LNCS, pp. 117–128). https://doi.org/10.1007/978-3-642-32147-4_12

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