In this paper we deal with sensitivity analysis in convex quadratic programming, without making assumptions on nondegeneracy, strict convexity of the objective function, and the existence of a strictly complementary solution. We show that the optimal value as a function of a right--hand side...

Optimal solutions of interior point algorithms for linear and quadratic programming and linear complementarity problems provide maximal complementary solutions. Maximal complementary solutions can be characterized by optimal (tri)partitions. On the other hand, the solutions provided by...

The literature in the field of interior point methods for Linear Programming has been almost exclusively algorithmic oriented. Very few contributions have been made towards the theory of Linear Programming itself. In particular none of them offer a simple, self-contained introduction to the...

The frequency assignment problem (FAP) is the problem of assigning frequencies to transmission links such that no interference between signals occurs. This implies distance constraints between assigned frequencies of links. The objective is to minimize the number of used frequencies. We present...