A New Linearizing Method for Sum of Linear Ratios Problem with Coefficients
A new linearizing method is presented for globally solving sum of linear ratios problem with coefficients. By using the linearizing method, linear relaxation programming (LRP) of the sum of linear ratios problem with coefficients is established, which can provide the reliable lower bound of the opti...
Saved in:
Main Authors: | Hongwei Jiao, Yongqiang Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/490297 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Global Optimization Algorithm for Sum of Linear Ratios Problem
by: Yuelin Gao, et al.
Published: (2013-01-01) -
Linear Combinations of Univalent Mappings with Complex Coefficients
by: Zhihong Liu, et al.
Published: (2021-01-01) -
The Generalization of the Poisson Sum Formula Associated with the Linear Canonical Transform
by: Jun-Fang Zhang, et al.
Published: (2012-01-01) -
Linear Programming Problem with Interval Type 2 Fuzzy Coefficients and an Interpretation for Its Constraints
by: A. Srinivasan, et al.
Published: (2016-01-01) -
Competitive two person zero-sum game with linear increment function
by: Jolanta Dranseikienė, et al.
Published: (2000-12-01)