An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem

This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, management optimization, and so on. In this algorithm, b...

Full description

Bibliographic Details

Published in:	Mathematical problems in engineering Vol. 2021; pp. 1 - 10
Main Authors:	Jia, Pujun, Jiao, Hongwei, Shi, Dongwei, Yin, Jingben
Format:	Journal Article
Language:	English
Published:	New York Hindawi 27.11.2021 John Wiley & Sons, Inc
Subjects:	Algorithms Lower bounds Mathematical problems Mathematical programming Minimax technique Optimization Ratios
ISSN:	1024-123X, 1563-5147
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!