Global minimization of a generalized linear multiplicative programming

  • Wang C
  • Liu S
  • Shen P
  • 3


    Mendeley users who have this article in their library.
  • 13


    Citations of this article.


This article presents a simplicial branch and bound algorithm for globally solving generalized linear multiplicative programming problem (GLMP). Since this problem does not seem to have been studied previously, the algorithm is apparently the first algorithm to be proposed for solving such problem. In this algorithm, a well known simplicial subdivision is used in the branching procedure and the bound estimation is performed by solving certain linear programs. Convergence of this algorithm is established, and some experiments are reported to show the feasibility of the proposed algorithm. © 2011 Elsevier Inc.

Author-supplied keywords

  • Branch and bound
  • Global optimization
  • Multiplicative programming
  • Simplicial bisection

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free