Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.
I have doubt regarding Fourier-Motzkin algorithm. When I was reading the slides, i have seen the below:
How it's concluded that x1 does not have lower bounds? If the lower bound is negative infinity, then is it applicable for x0 and x2? How x2 does not have upper bound? Could you please clarify these?