By Topic

A Global Optimization Method for the Nonlinear Sum of Ratios Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhongmin Fang ; Sch. of Traffic & Transp. Eng., Center South Univ., Changsha, China ; Zhiya Chen

This article presents global optimization algorithm for globally solving the nonlinear sum of ratios problem (NRS) on nonconvex feasible region. Two folds are presented. Firstly, a problem (P1) is derived which is equivalent to problem (NRS). Second, by utilizing the parametric linearization relaxation method, initial non-convex nonlinear problem (NRS) is reduce to a sequence of linear programming problems through the successive refinement of a linear relaxation of feasible region and of the objective function. The proposed branch and bound algorithm is convergent to the global minimum through the successive refinement of the solutions of a series of linear programming problems. A numerical example is given to illustrate the feasibility of the present algorithm.

Published in:

Computational Science and Optimization (CSO), 2010 Third International Joint Conference on  (Volume:2 )

Date of Conference:

28-31 May 2010