We present a new corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available. In contrast with its predictor-corrector counterpart proposed by Miao, the method does not depend on the handicap κ of the problem. The method has O((1+ κ)√nL)-iteration complexity, the same as Miao’s method, but our error est...

Determining worst case execution time of a program by static analysis is important for the design of real-time software. WCET analysis at the programming language level requires the detection of the longest path in the program. A tighter bound on the WCET of a program can be achieved by identifying the infeasible paths in the program’s control flow, which is a difficult problem. Due to the bran...

A classical problem in the study of an infeasible system linear inequalities is to determine irreducible subsystems (IISs), i.e., subsets whose proper are feasible. In this article, we examine a particular situation where only given subsystem interest for analysis infeasibility. For this, define relatively (RIISs) as that with respect subsystem. It generalization definition IIS, since IIS full ...

The contribution of infeasible solutions in heuristic searches for vehicle routing problems does not make, up to date, a consensus in the metaheuristics community. In one hand, infeasible solutions may allow to transition between structurally different feasible solutions, thus enhancing the search. In the other hand they also lead to more complex move evaluation procedures and in wider search s...

In semidefinite programming (SDP), unlike in linear programming, Farkas’ lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any equality constrained semidefinite system using only elementary row operations, and rotations. When a system is infeasible, the reformulated system is trivially infeasible. ...

Workflow testing is an important method of workflow analysis in design time. A challenging problem with trace-oriented test data generation in particular and trace-based workflow analysis in general is the existence of infeasible traces for which there is no input data for them to be executed. In this paper we build on the theory of workflow nets and introduce workflow nets where transitions ha...