in this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (hlcps). the algorithm uses only full-newton steps which has the advantage that no line searchs are needed. moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

In this paper we propose a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a service provider and clients. We assume the probability space to be discrete which allows us to reformulate the pro...

In this paper we first present a mathematical programming problem, the Extended Linear Complementarity Problem (ELCP). Next we discuss how the ELCP can be used to solve some basic problems in the system theory for a class of discrete event systems that can be modeled using the max-plus algebra, which has maximization and addition as basic operations. Finally we show that the ELCP also appears i...

We show that the problem of finding a singular value decomposition of a matrix in the extended max algebra can be reformulated as an Extended Linear Complementarity Problem. This allows us to compute all the max-algebraic singular value decompositions of a matrix. This technique can also be used to calculate many other max-algebraic matrix decompositions.

The origins and some motivational details of a collection of nonlinear mixed complementarity problems are given. This collection serves two purposes. Firstly, it gives a uniform basis for testing currently available and new algorithms for mixed complementarity problems. Function and Jacobian evaluations for the resulting problems are provided via a GAMS interface, making thorough testing of alg...

We present an overview of our research on the use of generalized linear complementarity problems (LCPs) for analysis of continuously variable systems and discrete event systems. We indicate how the Generalized LCP can be used to analyze piecewise-linear resistive electrical circuits. Next we discuss how the Extended LCP can be used to solve some fundamental problems that arise in max-algebraic ...

First we give a short description of the Extended Linear Complementarity Problem (ELCP), which is a mathematical programming problem. We briefly discuss how this problem can be used in the analysis of discrete event systems and continuous variable systems. Next we show that the ELCP can also be used to model and to analyze hybrid systems. More specifically, we consider a traffic-light-controlle...

Recent improvements in the capabilities of complementarity solvers have led to an increased interest in using the complementarity problem framework to address practical problems arising in mathematical programming, economics, engineering, and the sciences. As a result, increasingly more diicult problems are being proposed that exceed the capabilities of even the best algorithms currently availa...