受限于加法-Łukasiewicz模糊关系不等式的极小极大规划问题及其最优解
Minimax programming problems subject to addition-Łukasiewicz fuzzy relational inequalities and their optimal solutions
AI总结：
本文研究受限于加法-Łukasiewicz模糊关系不等式的极小极大规划问题，建立了极小解的充要条件与存在性条件，提出搜索极小解的算法并将其应用于寻找最优解，获得了最大最优解和极小最优解。
摘要：
本文关注受限于加法-Łukasiewicz模糊关系不等式的极小极大规划问题。我们首先建立了模糊关系不等式的解为极小解的两个充分必要条件，并探讨了唯一极小解的存在条件。我们还提供了一种算法，从给定解出发搜索模糊关系不等式的极小解。随后，我们将模糊关系不等式的极小解应用于极小极大规划问题以搜索最优解。我们提供了两种算法来求解一类单变量优化问题，并获得了最大最优解。寻找给定解的极小解的算法也被用于搜索极小最优解。
英文摘要：
This article focuses on minimax programming problems subject to addition-Łukasiewicz fuzzy relational inequalities. We first establish two necessary and sufficient conditions that a solution of the fuzzy relational inequalities is a minimal one and explore the existence condition of the unique minimal solution. We also supply an algorithm to search for minimal solutions of the fuzzy relational inequalities starting from a given solution. We then apply minimal solutions of the fuzzy relational inequalities to the minimax programming problems for searching optimal solutions. We provide two algorithms to solve a kind of single variable optimization problems, and obtain the greatest optimal solution. The algorithm for finding minimal solutions of a given solution are also used for searching minimal optimal solutions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
