An Effective Algorithm for Globally Solving Sum of Linear Ratios Problems
In this study, we propose an effective algorithm for globally solving the sum of linear ratios problems. Firstly, by introducing new variables, we transform the initial problem into an equivalent nonconvex programming problem. Secondly, by utilizing direct relaxation, the linear relaxation programmi...
Saved in:
| Main Authors: | Hongwei Jiao, Lei Cai, Zhisong Hou, Chunyang Bai |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Control Science and Engineering |
| Online Access: | http://dx.doi.org/10.1155/2017/8138975 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Global Optimization for the Sum of Concave-Convex Ratios Problem
by: XueGang Zhou, et al.
Published: (2014-01-01) -
An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem
by: Lei Cai, et al.
Published: (2017-01-01) -
Covering energy, linear sum and vertical sum of posets
by: Vandana P. Bhamre, et al.
Published: (2025-01-01) -
Solving the Problem of Linear Programming with Cost Coefficients and Grey Resources Using the Primal Simplex Algorithm
by: Farid Pourofoghi
Published: (2022-06-01) -
The development of the word sum-wheel to enhance Grade 3 teachers’ mathematic word problem solving instruction.
by: Nadia Swanepoel, et al.
Published: (2024-12-01)