极小化线性分式函数的全局优化算法

赵鹏, 申培萍, 钟哲伟

doi:10.13371/j.cnki.chin.q.j.m.2026.01.004

数学季刊 >

2026 , Vol. 41 >Issue 1: 50 - 59

DOI: https://doi.org/10.13371/j.cnki.chin.q.j.m.2026.01.004

极小化线性分式函数的全局优化算法

展开

School of Mathematics and Statistics, North China University of Water Resources and Electric Power, Zhengzhou 450046, China

ZHAO Peng (2000-), male, native of Xinxiang, Henan, master student of North China University of Water Resources and Electric Power, engages in optimization theory and application research; SHEN Pei-ping (1964-), female, native of Nanyang, Henan, professor of North China University of Water Resources and Electric Power, Ph.D, engages in optimisation theory and applicatio; ZHONG Zhe-wei (2000-), male, native of Hangzhou, Zhejiang, master student of North China University of Water Resources and Electric Power, mainly engages in optimization theory and application research.

SHEN Pei-ping (1964-), female, native of Nanyang, Henan, professor of North China University of Water Resources and Electric Power, Ph.D, engages in optimisation theory and applicatio;

收稿日期: 2025-04-07

网络出版日期: 2026-03-30

基金资助

Supported by the National Natural Science Foundation of China (Grant Nos. 12571317 and 12071133).

收起

Global Optimization Algorithm for Minimizing Linear Fractional Programming

Expand

School of Mathematics and Statistics, North China University of Water Resources and Electric Power, Zhengzhou 450046, China

SHEN Pei-ping (1964-), female, native of Nanyang, Henan, professor of North China University of Water Resources and Electric Power, Ph.D, engages in optimisation theory and applicatio;

Received date: 2025-04-07

Online published: 2026-03-30

Supported by

Supported by the National Natural Science Foundation of China (Grant Nos. 12571317 and 12071133).

Fold

摘要

In this paper, we study a class of Linear Fractional Programming on a nonempty bounded set, called the Problem (LFP), and design a branch and bound algorithm to find the global optimal solution of the problem (LFP). First, we convert the problem (LFP) to the equivalent problem (EP2). Secondly, by applying the linear relaxation technique to the problem (EP2), the linear relaxation programming problem (LRP2_Y ) was obtained. Then, the overall framework of the algorithm is given, and the convergence and complexity of the algorithm are analyzed. Finally, experimental results are listed to illustrate the effectiveness of the algorithm.

关键词： Global optimization; Linear Fractional Programming; Branch and bound algorithm; Linear relaxation

本文引用格式

赵鹏, 申培萍, 钟哲伟 . 极小化线性分式函数的全局优化算法[J]. 数学季刊, 2026 , 41(1) : 50 -59 . DOI: 10.13371/j.cnki.chin.q.j.m.2026.01.004

Abstract

Key words： Global optimization; Linear Fractional Programming; Branch and bound algorithm; Linear relaxation

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract