A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
Sign Up to like & getrecommendations! Published in 2017 at "Annals of Operations Research"
DOI: 10.1007/s10479-016-2135-2
Abstract: The problem (LFP) of finding a feasible solution to a given linear semi-infinite system arises in different contexts. This paper provides an empirical comparative study of relaxation algorithms for (LFP). In this study we consider,… read more here.
Keywords: relaxation; problem; relaxation algorithms; comparative note ... See more keywords