In this paper, we present a n o verview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate n-ary relations over R I with Cartesian products of intervals whose bounds are taken in a nite subset of R I. V ariables represent real values whose domains are intervals deened in the same manner. Narrowing operators ar...

Bilevel linear programming  is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming  with inexact parameters has been studied and a method is...

‎we consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals‎. ‎contrary to classical models‎, ‎where parameters can attain any value from the interval domains independently‎, ‎we study problems with linear dependencies between the parameters‎. ‎we present a class of problems that are easily solved by reduction to the classi...