Abstract
We consider a quadratic programming (QP) problem (Π) of the form min x T C x subject to Ax ≥ b, x ≥ 0 where \({C\in {\mathbb R}^{n \times n}_+, {\rm rank}(C)=1}\) and \({A\in {\mathbb R}^{m \times n}, b\in {\mathbb R}^m}\) . We present an fully polynomial time approximation scheme (FPTAS) for this problem by reformulating the QP (Π) as a parameterized LP and “rounding” the optimal solution. Furthermore, our algorithm returns an extreme point solution of the polytope. Therefore, our results apply directly to 0–1 problems for which the convex hull of feasible integer solutions is known such as spanning tree, matchings and sub-modular flows. They also apply to problems for which the convex hull of the dominant of the feasible integer solutions is known such as s, t-shortest paths and s, t-min-cuts. For the above discrete problems, the quadratic program Π models the problem of obtaining an integer solution that minimizes the product of two linear non-negative cost functions.
Similar content being viewed by others
References
Boyd S., Vandenberghe L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Brønsted A.: An Introduction to Convex Polytopes. Graduate Texts in Mathematics, vol .90. Springer, New York (1983)
Gould, N., Toint, P.: A quadratic programming bibliography. Numer. Anal. Group Intern. Rep. 1 (2000)
Hassin R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36–42 (1992)
Kern W., Woeginger G.: Quadratic programming and combinatorial minimum weight product problems. Math. Programm. 110(3), 641–649 (2007)
Matsui T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9(2), 113–119 (1996)
Pardalos P., Vavasis S.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1(1), 15–22 (1991)
Ravi, R., Goemans, M.: The constrained minimum spanning tree problem. In: Proceedings of 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, 3–5 July 1996 (1996)
Vavasis S.: Approximation algorithms for indefinite quadratic programming. Math. Program. 57(1), 279–311 (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
Vineet Goyal’s and R. Ravi’s research is supported in part by NSF grant CCF-0728841.
Rights and permissions
About this article
Cite this article
Goyal, V., Genc-Kaya, L. & Ravi, R. An FPTAS for minimizing the product of two non-negative linear cost functions. Math. Program. 126, 401–405 (2011). https://doi.org/10.1007/s10107-009-0287-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-009-0287-4