A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems-Reference-Cited by-同舟云学术

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

Published:2011-04 Issue:2 Volume:4 Page:134-141
ISSN:1875-6891
Container-title:International Journal of Computational Intelligence Systems
language:en
Short-container-title:International Journal of Computational Intelligence Systems

Author:

Feng Qigao,Jiao Hongwei,Mao Hanping,Chen Yongqiang

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,General Computer Science

Link

http://www.tandfonline.com/doi/pdf/10.1080/18756891.2011.9727770

Reference35 articles.

1. Schaible, S. and Shi, J. Recent developments in fractional programming: single ratio and maxmin cale. Proc. 3rd Intl. Conf. Nonlinear Anal. Convex Anal. pp.493–4506. Tokyo, Japan

2. Duality in nondifferentiable minimax fractional programming with generalized convexity

3. A branch and bound algorithm for globally solving a class of nonconvex programming problems

4. Global optimization of generalized linear fractional programming with nonlinear constraints

5. A branch-and-bound algorithm to globally solve the sum of several linear ratios

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Outer space branching search method for solving generalized affine fractional optimization problem;AIMS Mathematics;2023

2. A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints;Optimization;2021-06-08

3. A new branch and bound algorithm for minimax ratios problems;Open Mathematics;2017-06-22

4. A new linearization technique for minimax linear fractional programming;International Journal of Computer Mathematics;2014-01-16

5. An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming;Journal of Applied Mathematics;2014