Global Optimization for the Sum of Concave-Convex Ratios Problem
Joint Authors
Source
Journal of Applied Mathematics
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-05-12
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
This paper presents a branch and bound algorithm for globally solving the sum of concave-convex ratios problem (P) over a compact convex set.
Firstly, the problem (P) is converted to an equivalent problem (P1).
Then, the initial nonconvex programming problem is reduced to a sequence of convex programming problems by utilizing linearization technique.
The proposed algorithm is convergent to a global optimal solution by means of the subsequent solutions of a series of convex programming problems.
Some examples are given to illustrate the feasibility of the proposed algorithm.
American Psychological Association (APA)
Zhou, Xue-Gang& Yang, JiHui. 2014. Global Optimization for the Sum of Concave-Convex Ratios Problem. Journal of Applied Mathematics،Vol. 2014, no. 2014, pp.1-10.
https://search.emarefa.net/detail/BIM-505675
Modern Language Association (MLA)
Zhou, Xue-Gang& Yang, JiHui. Global Optimization for the Sum of Concave-Convex Ratios Problem. Journal of Applied Mathematics No. 2014 (2014), pp.1-10.
https://search.emarefa.net/detail/BIM-505675
American Medical Association (AMA)
Zhou, Xue-Gang& Yang, JiHui. Global Optimization for the Sum of Concave-Convex Ratios Problem. Journal of Applied Mathematics. 2014. Vol. 2014, no. 2014, pp.1-10.
https://search.emarefa.net/detail/BIM-505675
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-505675