Tagged Questions
3
votes
1answer
128 views
Steps in the Simplex Method
I'm trying to look at how the Simplex method in standard form works. I understand the basics of how ti works, but I can't understand what happens between two steps.
I'm using the example from chapter ...
3
votes
3answers
187 views
0-1 knapsack like - the set of all non-contained affordable binary selections
This is my first question here, so please go easy on me :)
The following problem is – I think - similar to the 0-1 knapsack problem. It's simplified somehow in that each item has only a cost ...
1
vote
0answers
101 views
1s surpassing 0s in binary strings of odd length
Let $A(k)$ be the number of distinct binary strings of length $2k+1,$ for which the number of $1$s surpasses the number of $0$s for the first time at digit number $2k +1$, i.e., in the final digit in ...
3
votes
1answer
155 views
What is the complexity of computing the minimum distance between two convex polyhedra that both have $n$ faces?
EDIT: (in response to what deinst said) sometimes using a sledgehammer for some menial task is rather convenient - especially if it also has the complexity $O(n)$ (which is what my question is about) ...
2
votes
0answers
160 views
Approximate Set Cover Problem by Rounding
Here is the simple algorithm for approximating set cover problem using rounding:
Algorithm 14.1 (Set cover via LP-rounding)
Find an optimal solution to the LP-relaxation.
Pick all sets ...
1
vote
1answer
2k views
Degeneracy in Linear Programming
Consider the standard form polyhedron, and assume that the rows of the matrix A are linearly independent.
$$ \left \{ x | Ax = b, x \geq 0 \right \} $$
(a) Suppose that two different bases lead to ...
1
vote
1answer
188 views
Lower bound for the complexity of linear programming
Since it is known that you can sort $n$ numbers by solving a certain kind of linear program - doesn't this imply a lower bound on the complexity of solving linear programs in general via the lower ...
6
votes
3answers
893 views
What is linear programming?
I asked this question on Stack Overflow but it was closed as "not programming related". So I think this is probably the best place for it...
I read over the wikipedia article, but it seems to be ...