Abstract
An algorithm for solving a linear multiplicative programming problem (referred to as LMP) is proposed. LMP minimizes the product of two linear functions subject to general linear constraints. The product of two linear functions is a typical non-convex function, so that it can have multiple local minima. It is shown, however, that LMP can be solved efficiently by the combination of the parametric simplex method and any standard convex minimization procedure. The computational results indicate that the amount of computation is not much different from that of solving linear programs of the same size. In addition, the method proposed for LMP can be extended to a convex multiplicative programming problem (CMP), which minimizes the product of two convex functions under convex constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F.A. Al-Khayyal, “Linear, quadratic and bilinear programming approaches to linear complementarity problem,”European Journal of Operational Research 24 (1986) 216–227.
Y.P. Aneja, V. Aggarwal and K.P.K. Nair, “On a class of quadratic programming,”European Journal of Operational Research 18 (1984) 62–70.
E. Balas and C.A. Burdet, “Maximizing a convex quadratic function subject to linear constraints,” MSRR 299 GSIA, Carnegie-Mellon University (Pittsburgh, PA, 1973).
C.R. Bector and M. Dahl, “Simplex type finite iteration technique and reality for a special type of pseudo-concave quadratic functions,”Cahiers du Centre d'Etudes de Recherche Operetionnelle 16 (1974) 207–222.
A.V. Cabot, “Variations on a cutting plane method for solving concave minimization problem with linear constraints,”Naval Research Logistics Quarterly 21 (1974) 265–274.
A.V. Cabot and R.L. Francis, “Solving nonconvex minimization problems by ranking the extreme points,”Operations Research 18 (1970) 82–86.
J.E. Falk and K.L. Hoffman, “A successive underestimation method for concave minimization problems,”Mathematics of Operations Research 1 (1976) 251–259.
J.E. Falk and R.M. Soland, “An algorithm for solving separable nonconvex programming problems,’Management Science 15 (1969) 550–569.
A. Geoffrion, “Solving bicriterion mathematical programs,”Operations Research 15 (1967) 39–54.
R. Horst, N.V. Thoai and H. Tuy, “Outer approximation by polyhedral convex sets,”OR Spektrum 9 (1987) 153–159.
R. Horst and H. Tuy,Global Optimization (Springer, Berlin, 1990).
B. Kalantari and J.B. Rosen, “An algorithm for global minimization of linearly constrained concave quadratic functions,”Mathematics of Operations Research 12 (1987) 544–561.
H. Konno, “A cutting plane algorithm for solving bilinear programs,”Mathematical Programming 11 (1976) 14–27.
H. Konno, “Maximization of a convex quadratic function under linear constraints,”Mathematical Programming 11 (1976) 117–127.
H. Konno, “Maximizing a convex quadratic function over a hypercube,”Journal of the Operations Research Society of Japan 23 (1980) 171–189.
H. Konno, “Minimum concave cost production sytem: A further generalization of multi-echelon model,”Mathematical Programming 41 (1988) 185–193.
H. Konno and T. Kuno, “Generalized linear multiplicative and fractional programming,”Annals of Operations Research 25 (1990) 147–162.
H. Konno, Y. Yajima and T. Matsui, “Parametric simplex algorithms for solving a special class of nonconvex minimization problems,”Journal of Global Optimization 1 (1991) 65–81.
T. Kuno and H. Konno, “A parametric successive underestimation method for convex multiplicative programming problems,”Journal of Global Optimization 1 (1991) 267–285.
A. Majthay and A. Whinston, “Quasiconcave minimization subject to linear constraints,”Discrete Mathematics 1 (1974) 35–39.
K.G. Murty, “Solving the fixed charge problem by ranking the extreme points,”Operations Research 16 (1969) 268–279.
P.M. Pardalos, “Polynomial time algorithms for some classes of constrained non-convex quadratic problems,” Computer Science Department, The Pennsylvania State University (University Park, PA, 1988).
P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science No. 268 (Springer, Berlin, 1987).
K. Ritter, “A method for solving maximum problems with a nonconcave quadratic objective functions,”Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 4 (1966) 340–351.
J.B. Rosen, “Global minimization of a linearly constrained concave function by partition of feasible domain,”Mathematics of Operations Research 8 (1983) 215–230.
K. Swarup, “Programming with indefinite quadratic function with linear constraints,”Cahiers du Centre d'Études de Recherche Opérationnelle 8 (1966) 133–136.
N.V. Thoai and H. Tuy, “Convergent algorithms for minimizing a concave function,”Mathematics of Operations Research 5 (1980) 556–566.
H. Tuy, “Concave programming under linear constraints,”Soviet Mathematics Doklady 5 (1964) 1437–1440.
W.I. Zangwill, “A backlogging model and a multi-echelon model of a dynamic economic lot size production system — A network approach,”Management Science 15 (1969) 506–527.
P.B. Zwart, “Global maximization of a convex function with linear inequality constraints,”Operations Research 22 (1974) 602–609.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Konno, H., Kuno, T. Linear multiplicative programming. Mathematical Programming 56, 51–64 (1992). https://doi.org/10.1007/BF01580893
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580893