Advanced search
Publication Cover
International Journal of Computational Intelligence Systems Volume 4, 2011 - Issue 2
Journal homepage
47
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems

Qigao Feng Institute of Agricultural Engineering, Jiangsu University, Zhenjiang, 212013, China; College of Mechanical and Electrical, Henan Institute of Science and Technology, Xinxiang, 453003, China E-mail: [email protected]
,
Hongwei Jiao Department of Mathematics, Henan Institute of Science and Technology, Xinxiang, 453003, China E-mail: jiaohongwei@l 26. com
,
Hanping Mao Institute of Agricultural Engineering, Jiangsu University, Zhenjiang, 212013, China E-mail: [email protected]
&
Yongqiang Chen College of Mathematics and Information Science, Henan Normal University, Xinxiang, 453007, China E-mail: [email protected]
Pages 134-141 | Received 12 Aug 2009, Accepted 31 Jan 2011, Published online: 12 Mar 2012

Citations (5)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Naser Osmanpour & Mohammad Keyanpour. (2022) A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints. Optimization 71:14, pages 4107-4123.
Read now
Hongwei Jiao & Sanyang Liu. (2014) A new linearization technique for minimax linear fractional programming. International Journal of Computer Mathematics 91:8, pages 1730-1743.
Read now

Articles from other publishers (3)

Junqiao Ma, Hongwei Jiao, Jingben Yin & Youlin Shang. (2023) Outer space branching search method for solving generalized affine fractional optimization problem. AIMS Mathematics 8:1, pages 1959-1974.
Crossref
Yingfeng Zhao, Sanyang Liu & Hongwei Jiao. (2017) A new branch and bound algorithm for minimax ratios problems. Open Mathematics 15:1, pages 840-851.
Crossref
Hong-Wei Jiao, Feng-Hui Wang & Yong-Qiang Chen. (2014) An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming. Journal of Applied Mathematics 2014, pages 1-8.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.