\input zb-basic
\input zb-ioport
\iteman{io-port 06040809}
\itemau{Wei, Fei; Gao, Yuelin; Liu, Junmei}
\itemti{A simplex branch-and-bound method of a class of multi-product programming problems.}
\itemso{J. Nat. Sci. Heilongjiang Univ. 28, No. 1, 61-66 (2011).}
\itemab
Summary: A class of multi-product programming problems is equivalently converted into a concave minimization problem by using the properties of logarithmic functions. A linear programming relaxation problem is given to determine the lower bound of the global optimal value of the original problem. Thereby, a simplex branch-and-bound method for solving a class of multi-product problems is proposed and the convergence proof of the proposed method is given. Numerical examples show that the proposed method is feasible and effective.
\itemrv{~}
\itemcc{}
\itemut{global optimization; concave multiplicative programming; branch-and-bound method; convex envelope}
\itemli{}
\end