This paper presents a system for solving mixed infinite and finite domains linear problem using a Constraint Logic Programming (CLP) Environment. The contributions of our system are introduced in two directions. Firstly, unlike existing systems, the splitting of a variable’s domain is based on the right hand side value of the first constraint in which it is involved rather than the splitting over an arbitrary value. Also, the splitting process is automatically performed by the system, when needed, rather than being the user’s responsibility. Secondly, a relatively transparent integration is met between two Constraint Logic Programming solvers. The former is a Partial Look Ahead solver over rationals as well as integers with the support of the aforementioned domain splitting mechanism, while the latter is a Simplex-Like solver named CLP(Q). Each counterpart submits some services to the other in order that the coherent system improves the search efficiency and tackles their individual main defects.