Local Approximability of Max-Min and Min-Max Linear Programs

In a max-min LP , the objective is to maximise ω subject to A x ≤ 1 , C x ≥ ω 1 , and x ≥ 0 . In a min-max LP , the objective is to minimise ρ subject to A x ≤ ρ 1 , C x ≥ 1 , and x ≥ 0 . The matrices A and C are nonnegative and sparse: each row a i of A has at most Δ I positive elements, and each r...

Celý popis