首页> 外文期刊>International Journal of Uncertainty, Fuzziness, and Knowledge-based Systems >Linear Programming Method for Solving Semi-Latticized Fuzzy Relation Geometric Programming with Max-Min Composition
【24h】

Linear Programming Method for Solving Semi-Latticized Fuzzy Relation Geometric Programming with Max-Min Composition

机译:最大最小组成的半线性化模糊关系几何规划的线性规划方法

获取原文
获取原文并翻译 | 示例
           

摘要

Motivated by application in BitTorrent-like Peer-to-Peer resource sharing system, we introduce the maximization and minimization semi-latticized fuzzy relation geometric programming problems with max-min composition in this paper. The objective function in the proposed problem in nonlinear and the feasible domain is non-convex. The maximization problem is converted into a fuzzy relation monomial geometric programming and then solved. However, this approach is not effective for the minimization one. The linear programming method is applied to deal with the minimization problem. A step-to-step algorithm is develop to carried out the linear programming method and tow illustrative examples are provided at last.
机译:出于在类似BitTorrent的点对点资源共享系统中的应用动机,本文介绍了具有最大-最小组成的最大化和最小化半格子模糊关系几何规划问题。所提出的非线性和可行域问题的目标函数是非凸的。最大化问题被转换成模糊关系单项几何规划,然后求解。但是,这种方法对于最小化是无效的。应用线性规划方法来处理最小化问题。开发了一种逐步算法来执行线性规划方法,最后提供了两个说明性示例。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号