Access the full text.
Sign up today, get DeepDyve free for 14 days.
In this paper, a new global algorithm is presented to globally solve the linear multiplicative programming (LMP). The problem (LMP) is firstly converted into an equivalent programming problem (LMP (H)) by introducing p auxiliary variables. Then by exploiting structure of (LMP(H)), a linear relaxation programming (LP (H)) of (LMP (H)) is obtained with a problem (LMP) reduced to a sequence of linear programming problems. The algorithm is used to compute the lower bounds called the branch and bound search by solving linear relaxation programming problems (LP(H)). The proposed algorithm is proven that it is convergent to the global minimum through the solutions of a series of linear programming problems. Some examples are given to illustrate the feasibility of the proposed algorithm.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jun 19, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.