Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers


543 users

0 votes

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?

in # Study-Organisation (Master) by (2.7k points)

1 Answer

+1 vote
Best answer
If you solve the inequalities for x1, you will see that the left hand sides are minus infinity, so that x1 does not have lower bounds. That is a preferable case since then we can remove all equations where x1 occurs (see slides 85-90).
by (166k points)
selected by
I understood the point. But if i try to solve for x0 also i will get the can we take any of the variable from x0 and x1 ?
Sure, and also that is just an optimization. In general, you an pick any variable for elimination, just to save some work, those without upper/lower bounds are preferable.
Thank you, Professor.

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
asked Aug 14, 2022 in # Study-Organisation (Master) by yk (2.7k points)
0 votes
1 answer
Imprint | Privacy Policy