论文标题
一种分支和界限技术，用于查找受Lukasiewicz的线性优化问题的最小解决方案
A branch and bound technique for finding the minimal solutions of the linear optimization problems subjected to Lukasiewicz
论文作者
论文摘要
在本文中，研究了具有线性目标函数的优化模型，该模型受到模糊关系方程系统（FRE）的研究，在该系统由Lukasiewicz T-Norm定义的可行区域。由于发现所有最小解决方案都是NP硬化问题，因此设计一个有效的解决方案程序来解决此类问题并不是一项琐碎的工作。首先，对可行的域进行表征，然后使用基于包括最小解决方案的新解决方案集的修改分支和结合解决方案技术来解决问题。提出解决方案程序后，为了插图目的包括一个具体示例。
In this paper, an optimization model with a linear objective function subject to a system of fuzzy relation equations (FRE) is studied where the feasible region is defined by the Lukasiewicz t-norm. Since the finding of all minimal solutions is an NP-hard problem, designing an efficient solution procedure for solving such problems is not a trivial job. Firstly, the feasible domain is characterized and then the problem is solved with a modified branch-and-bound solution technique based on a new solution set that includes the minimal solutions. After presenting our solution procedure, a concrete example is included for illustration purposes.
