排序方式: 共有5条查询结果,搜索用时 140 毫秒
1
1.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
2.
3.
针对当前防空系统模型的构建和评估偏向于定性处理以及仅考虑其结构特性而忽视了系统中目标与关系自身属性的问题,在分析现有模型与评估方法的基础上,提出了基于邻接矩阵的防空系统模型,定义了能力评估向量,采用目标对体系能力贡献程度的目标价值综合评价方法,并引用Pareto占优中等级前沿和拥挤距离的思想提出了目标等级和目标离散度的概念,形成了非劣性价值排序算法,同时使用加权以及性价比方法和其他网络评估方法排序,采用自身设计以及随机生成案例进行仿真实验,结果验证了基于邻接矩阵的防空系统模型以及价值排序算法的有效性。 相似文献
4.
一个复杂的C4ISR系统由若干子系统组成,子系统之间的交互依赖关系应该尽量少.利用活动模型构造系统的活动邻接矩阵,用图论中的路径矩阵来识别强连通子图,从而得出交互依赖活动集.具有交互依赖关系的活动尽量安排在一个子系统内部.利用这种方法来对C4ISR系统进行重组. 相似文献
5.
1