Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Linear relaxation program

Sortuj według:

Ogranicz wyniki do:

Outcome space range reduction method for global optimization of sum of affine ratios problem

100%

Jiao H., Liu S., Yin J., Zhao Y.

Open Mathematics

2016

tom 14

nr 1

736-746

Many algorithms for globally solving sum of affine ratios problem (SAR) are based on equivalent problem and branch-and-bound framework. Since the exhaustiveness of branching rule leads to a significant increase in the computational burden for solving the equivalent problem. In this study, a new range reduction method for outcome space of the denominator is presented for globally solving the sum of affine ratios problem (SAR). The proposed range reduction method offers a possibility to delete a large part of the outcome space region of the denominators in which the global optimal solution of the equivalent problem does not exist, and which can be seen as an accelerating device for global optimization of the (SAR). Several numerical examples are presented to demonstrate the advantages of the proposed algorithm using new range reduction method in terms of both computational efficiency and solution quality.

Ograniczanie wyników

1 Open Mathematics

1 Jiao H.

1 Liu S.

1 Yin J.

1 Zhao Y.

1 2016

Wyniki wyszukiwania

Outcome space range reduction method for global optimization of sum of affine ratios problem