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


529 users

0 votes

For the Simplex Algorithm problem in the exam, before pivoting the variable do we need to check the below condition always?
Wouldn't the variables X0 and X1 if provided with limits from -inf to +inf, be sufficient to pivot for at least the first two iterations, without checking the condition?

in * TF "Emb. Sys. and Rob." by (410 points)

1 Answer

0 votes
The expression ensures that xj has room to move in a direction that will allow us to change the value of yi which currently violates one of its bounds. If xj is unbounded, i.e., has no bounds, then we can obviously choose it and don't have to check the above condition .
by (166k points)
Imprint | Privacy Policy