Abstract
We present a Lagrangian relaxation technique to solve a class of linear programs with negative coefficients in the objective function and the constraints. We apply this technique to solve (the dual of) covering linear programs with upper bounds on the variables: min {c ⊤ x|Ax ≥ b, x ≤ u, x ≥ 0} where \(c,u\in{\mathbb{R}}_{+}^m,b\in\mathbb{R}_+^n\) and \(A\in\mathbb{R}_+^{n\times m}\) have non-negative entries. We obtain a strictly feasible, (1+ε)-approximate solution by making O(mε − 2logm + min {n,loglogC}) calls to an oracle that finds the most-violated constraint. Here C is the largest entry in c or u, m is the number of variables, and n is the number of covering constraints. Our algorithm follows naturally from the algorithm for the fractional packing problem and improves the previous best bound of O(mε − − 2log (mC)) given by Fleischer [1]. Also for a fixed ε, if the number of covering constraints is polynomial, our algorithm makes a number of oracle calls that is strongly polynomial.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: Proceedings, ACM-SIAM Symposium on Discrete Algorithms, pp. 994–1003 (2004)
Shahrokhi, F., Matula, D.: The maximum concurrent flow problem. J. ACM 37, 318–334 (1990)
Plotkin, S., Shmoys, D., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20, 257–301 (1995)
Luby, M., Nisan, N.: A parallel approximation algorithm for positive linear programming. In: Proceedings, ACM Symposium on Theory of Computing, pp. 448–457 (1993)
Grigoriadis, M., Khachiyan, L.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optimization 4, 86–107 (1994)
Grigoriadis, M., Khachiyan, L.: Approximate minimum-cost multicommodity flows in Õ (ε − 2 knm) time. Math. Programming 75, 477–482 (1996)
Young, N.: Randomized rounding without solving the linear program. In: Proceedings, ACM-SIAM Symposium on Discrete Algorithms, pp. 170–178 (1995)
Young, N.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings, IEEE Symposium on Foundations of Computer Science, pp. 538–546 (2001)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings, IEEE Symposium on Foundations of Computer Science, pp. 300–309 (1998)
Fleischer, L.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13, 505–520 (2000)
Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Kluwer Academic Publishers, Boston (2002); An early version also appears as CORE Lecture Series Monograph, Core, UCL, Belgium (2001), download from www.core.ucl.ac.be
Grigoriadis, M., Khachiyan, L.: Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21, 321–340 (1994)
Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Theoret. Comput. Sci., pp. 255–266 (2002)
Rockafellar, T.: Convex Analysis. Princeton University Press, Princeton (1970)
Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems. PhD thesis, Indian Institute of Technology Delhi (2004), Available at http://www.cse.iitd.ernet.in/~rohitk
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, N., Khandekar, R. (2004). Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive