Abstract
On the basis of Soland's rectangular branch-and-bound, we develop an algorithm for minimizing a product of p (≥2) affine functions over a polytope. To tighten the lower bound on the value of each subproblem, we install a second-stage bounding procedure, which requires O(p) additional time in each iteration but remarkably reduces the number of branching operations. Computational results indicate that the algorithm is practical if p is less than 15, both in finding an exact optimal solution and an approximate solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley: Reading, MA 1983.
M. Avriel, W.E. Diewert, S. Schaible, and I. Zang, Generalized Convexity, Plenum Press: New York, 1988.
E. Balas and E. Zemel, “An algorithm for large zero-one knapsack problems, ” Operations Research, vol. 28, pp. 1130–1154, 1980.
H.P. Benson, “An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming, ” Journal of Global Optimization, vol. 15, pp. 315–342, 1999.
H.P. Benson and G.M. Boger, “Multiplicative programming problems: Analysis and efficient point search heuristic, ” Journal of Optimization Theory and Applications, vol. 94, pp. 487–510, 1997.
V. Chvătal, Linear Programming, W.H. Freeman: New York, 1983.
G.B. Dantzig, “Discrete variable extremum problems, ” Operations Research, vol. 5, pp. 266–277, 1957.
J.E. Falk and S.W. Palocsay, “Image space analysis of generalized fractional programs, ” Journal of Global Optimization, vol. 4, pp. 63–88, 1994.
J.E. Falk and R.M. Soland, “An algorithm for separable nonconvex programming problems, ” Management Science, vol. 15, pp. 550–569, 1969.
G.M. Guisewite and P.M. Pardalos, “Minimum concave-cost network flow problems: Applications, complexity and algorithms, ” Annals of Operations Research, vol. 25, pp. 75–100, 1990.
M. Geoffrion, “Solving bicriterion mathematical programs, ” Operations Research, vol. 15, pp. 39–54, 1967.
J.M. Henderson and R.E. Quandt, Microeconomic Theory, McGraw-Hill: New York, 1971.
R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, 2nd ed. Springer-Verlag: Berlin, 1993.
H. Konno and T. Kuno, “Linear multiplicative programming, ” Mathematical Programming, vol. 56, pp. 51–64, 1992.
H. Konno and T. Kuno, “Multiplicative programming problems, ” in Handbook of Global Optimization, R. Horst and P.M. Pardalos (Eds.), Kluwer Academic Publishers: Dordrecht, 1995, pp. 369–405.
H. Konno, T. Kuno, and Y. Yajima, “Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial, ” Computational Optimization and Applications, vol. 1, pp. 227–239, 1992.
H. Konno, P.T. Thach, and H. Tuy, Optimization on Low Rank Nonconvex Structures, Kluwer Academic Publishers: Dordrecht, 1997.
H. Konno and H. Watanabe, “Bond portfolio optimization problems and their applications to index tracking: A partial optimization approach, ” Journal of Operations Research Society of Japan, vol. 39, pp. 295–306, 1996.
H. Konno, Y. Yajima, and T. Matsui, “Parametric simplex algorithms for solving a special class of nonconvex minimization problems, ” Journal of Global Optimization, vol. 1, pp. 65–81, 1991.
T. Kuno, “Globally determining a minimum-area rectangle enclosing the projection of higher-dimensional set, ” Operations Research Letters, vol. 13, pp. 295–303, 1993.
T. Kuno, Y. Yajima, and H. Konno, “An outer approximation method for minimizing the product of several convex functions on a convex set, ” Journal of Global Optimization, vol. 3, pp. 325–335, 1993.
X.J. Liu, T. Umegaki, and Y. Yamamoto, “Heuristic methods for linear multiplicative programming, ” Journal of Global Optimization, vol. 15, pp. 433–447, 1999.
T. Matsui, “NP-hardness of linear multiplicative programming and related problems, ” Journal of Global Optimization, vol. 9, pp. 113–119, 1996.
H.S. Ryoo and N.V. Sahinidis, “A branch-and-reduce approach to global optimization, ” Journal of Global Optimization, vol. 8, pp. 107–138, 1996.
S. Schaible and C. Sodini, “Finite algorithm for generalized linear multiplicative programming, ” Journal of Optimization Theory and Applications, vol. 87, pp. 441–455, 1995.
R.M. Soland, “Optimal facility location with concave costs, ” Operations Research, vol. 22, pp. 373–382, 1974.
K. Swarup, “Programming with indefinite quadratic function with linear constraints, ” Cahiers du d' Études de Recherche Opérationnelle, vol. 8, pp. 132–136, 1966.
N.V. Thoai, “A global optimization approach for solving the convex multiplicative programming problem, ” Journal of Global Optimization, vol. 1, pp. 341–357, 1991.
H. Tuy, “Polyhedral annexation, dualization and dimension reduction technique in global optimization, ” Journal of Global Optimization, vol. 1, pp. 229–244, 1991.
H. Tuy and B.T. Tam, “An efficient solution method for rank two quasiconcave minimization problems, ” Optimization, vol. 24, pp. 43–56, 1992.
Rights and permissions
About this article
Cite this article
Kuno, T. A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming. Computational Optimization and Applications 20, 119–135 (2001). https://doi.org/10.1023/A:1011250901810
Issue Date:
DOI: https://doi.org/10.1023/A:1011250901810