This paper is intended to characterize three types of best approximate solutions for inconsistent linear inequality systems with an arbitrary number of constraints. It also gives conditions guaranteeing the existence of best uniform solutions and discusses potential applications.This work was partially supported by the MINECO of Spain and ERDF of EU, Grant MTM2014-59179-C2-1-P, and by the Australian Research Council, Project DP160100854
[[abstract]]We define an irreducible inconsistent system (IIS) such that every one of its proper sub...
The transportation problem, as a particular case of a linear programme, has probably the highest rel...
The transportation problem, as a particular case of a linear programme, has probably the highest rel...
International audienceThis paper is intended to characterize three types of best approximate solutio...
International audienceThis paper is intended to characterize three types of best approximate solutio...
This paper is intended to characterize three types of best approximate solutions for inconsistent li...
This paper is intended to characterize three types of best approximate solutions for inconsistent li...
AbstractA system of an arbitrary number of linear inequalities, over a real locally convex space, is...
AbstractA system of an arbitrary number of linear inequalities, over a real locally convex space, is...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
The numerical solution of a possibly inconsistent system of linear inequalities in the ℓ1 sense is c...
This thesis presents a probabilistic algorithm for the solution of system of homogeneous linear ineq...
In this paper we consider the parameter space of all the linear inequality systems, in the n-dimensi...
[[abstract]]We define an irreducible inconsistent system (IIS) such that every one of its proper sub...
The transportation problem, as a particular case of a linear programme, has probably the highest rel...
The transportation problem, as a particular case of a linear programme, has probably the highest rel...
International audienceThis paper is intended to characterize three types of best approximate solutio...
International audienceThis paper is intended to characterize three types of best approximate solutio...
This paper is intended to characterize three types of best approximate solutions for inconsistent li...
This paper is intended to characterize three types of best approximate solutions for inconsistent li...
AbstractA system of an arbitrary number of linear inequalities, over a real locally convex space, is...
AbstractA system of an arbitrary number of linear inequalities, over a real locally convex space, is...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
The numerical solution of a possibly inconsistent system of linear inequalities in the ℓ1 sense is c...
This thesis presents a probabilistic algorithm for the solution of system of homogeneous linear ineq...
In this paper we consider the parameter space of all the linear inequality systems, in the n-dimensi...
[[abstract]]We define an irreducible inconsistent system (IIS) such that every one of its proper sub...
The transportation problem, as a particular case of a linear programme, has probably the highest rel...
The transportation problem, as a particular case of a linear programme, has probably the highest rel...