arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.01310math.OC
收藏

多目标整数二次规划有效集上的双目标优化

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem

Ali Bencheikh, Mustapha Moulai, Ilies Badaoui

AI总结:

针对多目标整数二次规划有效集上的双线性分式优化问题,提出一种结合分支定界、有效割平面与整数检验的精确分支切割算法,并通过示例验证其运行机制。

摘要:

本文提出一种精确算法,用于在多目标整数二次规划的有效集上优化两个线性分式函数。这类问题产生于两个决策者(如企业)各自拥有一个偏好函数,需在多目标问题的有效集上进行优化的场景。该算法采用分支切割法,包含两个步骤:(1) 在决策空间中使用分支定界策略探索解空间;(2) 利用切割平面技术消除非有效解,所用的有效割由目标函数的非递增方向构造。此外,算法还结合了整数检验以进一步确保所得解的有效性。本文给出了一个完整示例,并通过逐步求解演示了该算法的运行过程。

英文摘要:

In this paper, we present an exact algorithm for optimizing two linear fractional over the efficient set of a multi-objective integer quadratic problem. This type of problems arises when two decision-makers, such as firms, each have a preference function to optimize over the efficient set of a multi-objective problem. The algorithm employs a branch-and-cut approach, which involves: (1) exploring the solution space using a branch-and-bound strategy in the decision space, and (2) eliminating inefficient solutions using a cutting plane technique with efficient cuts constructed from the non-increasing directions of objective functions. Additionally, integral tests are incorporated to further ensure the efficiency of the obtained solutions.We present a comprehensive example, accompanied by a step-by-step resolution, to demonstrate the functioning of the algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑