用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Generalized Concavity in Fuzzy Optimization and Decision Analysis; Jaroslav Ramík,Milan Vlach Book 2002 Springer Science+Business Media Ne

[复制链接]
楼主: Optician
发表于 2025-3-25 04:38:20 | 显示全部楼层
Book 2002 extremely useful in the analysis and solution ofoptimization problems, including problems of either single objectiveor multiple objectives. Not all of these results rely necessarily onconvexity and concavity; some of the results can guarantee that eachlocal optimum is also a global optimum, giving
发表于 2025-3-25 08:49:40 | 显示全部楼层
发表于 2025-3-25 12:47:56 | 显示全部楼层
发表于 2025-3-25 16:43:53 | 显示全部楼层
发表于 2025-3-25 21:05:31 | 显示全部楼层
Kommunikation auf Anwendungsebene. is a function we need not only the underlying set . and its subset . but also one additional set, in this case the set {0, 1} or any other two-element set. Moreover, we also need the notion of Cartesian product because functions are specially structured binary relations, in this case special subsets of . × {0, 1}.
发表于 2025-3-26 01:30:28 | 显示全部楼层
Technikgestaltung aus Frauenperspektiveria decision making, functions mapping the set of feasible alternatives into the unit interval [0, 1] of real numbers representing normalized utility functions can be interpreted as membership functions of fuzzy subsets of the underlying set of alternatives. However, functions with the range in [0, 1] arise in more contexts.
发表于 2025-3-26 05:08:12 | 显示全部楼层
发表于 2025-3-26 10:35:58 | 显示全部楼层
发表于 2025-3-26 14:23:32 | 显示全部楼层
Fuzzy Multi-Criteria Decision Makingria decision making, functions mapping the set of feasible alternatives into the unit interval [0, 1] of real numbers representing normalized utility functions can be interpreted as membership functions of fuzzy subsets of the underlying set of alternatives. However, functions with the range in [0, 1] arise in more contexts.
发表于 2025-3-26 20:49:41 | 显示全部楼层
Fuzzy Sequencing and SchedulingNevertheless, the resulting mathematical and computational problems often have the form of the following optimization problem: Given a finite number of jobs to be processed on a finite number of machines, find a feasible schedule that minimizes the value of a given objective function.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-26 02:49
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表