TITLE

Outcome Space Branch and Bound Algorithm for Globally Solving A Class of Linear Multiplicative Programming

AUTHOR(S)
Jingben Yin; Jing Chen
PUB. DATE
January 2013
SOURCE
International Journal of Digital Content Technology & its Applic;Jan2013, Vol. 7 Issue 1, p167
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This article present an outcome space branch and bound algorithm for globally solving a class of multiplicative programming problems. The main computation involve in solving the series of linear programming problems, and the algorithm economizes the required computations by conducting the branch and bound search in outcome space. The proposed algorithm will be convergent to the global optimal solution by means of the subsequent solutions of the sequence of linear relaxation programming problems in outcome space. Numerical experiments show that the proposed algorithm is feasible.
ACCESSION #
98865178

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics