search

coin-or / Clp

COIN-OR Linear Programming Solver
Other
396 stars 82 forks source link

How can we identify the redundant constrain from the feasible base? #232

Closed mengtsinghua closed 2 years ago

mengtsinghua commented 2 years ago

Discussed in https://github.com/coin-or/Clp/discussions/231

Originally posted by **mengtsinghua** March 31, 2022 ![image](https://user-images.githubusercontent.com/3416498/161053748-1cfe0dbe-fda7-4c4b-bcd7-d88f48983b77.png) Hi, I am a new learner about Simplex algorithem, just wonder how to identify the redundant constrain from the feasible base? e.g., from the attached screenshot, is there any solution or idea to identify the constrain of (x2 + x1 <= 4), please? objection function: max(z) = x1 + 2x2 s.t. x1 - x2 <= -1 and x1 = 1 and x2 + x1 <= 4, x1 >=0 and x2 >=0. Thanks for any kind of help.
mengtsinghua commented 2 years ago

Since it's not related to any flaw of the existing source code, I would like to close it, any ideas about this topic, please go to the Discussion channel, thanks.