Operations Research Asked by k88074 on August 19, 2021
Say that I have a binary IP
$$z=max_x {c^top x: Ax=b, xin B^n}$$
where $B^n$ is the set of $n$-dimensional $0-1$ vectors.
Its LP relaxation will be
$$z^{LP}=max_x {c^top x: Ax=b, 0leq xleq 1}$$
I empirically observe that $z^{LP}=z$ and the LP solves to a binary solution.
How can I structure a proof to show that $z^{LP}=z$ and $x^{LP}in B^n$?
You are looking for a proof for Total Unimodularity (TU). TU is a property by which a linear program will always have an integral solution. All you need to prove is that in your LP
What is TU
Sufficient Condition For TU
Why does TU guarantees integral solution for a LP
Consider the LP problem $Ax = b$ with basis $B$, the value of basic variables $x_B$ can be obtained as $$x_B = B^{-1}b = frac{operatorname{adj}(B)}{det(B)}b.$$
All network flow problems (shortest path, maximal flow, etc..) exhibit this property.
Answered by Palaniappan Chellappan on August 19, 2021
If I'm understanding your question properly, this is not true in general. What you can prove is that this can be solved to integrality algorithmically, by adding Gomory cuts. Once enough cuts are added, the optimal vertex of the LP has to give an integer solution.
This is known as the cutting plane method.
In your case, you can use this to show that once no more Gomory cuts can be found, $z^{LP}$ has to be equal to $z$ (this happens much sooner in practice, but for the purposes of a proof it's fine to consider the worst-case scenario).
Answered by Nikos Kazazakis on August 19, 2021
Get help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP