共查询到20条相似文献,搜索用时 31 毫秒
1.
K. Gowri Navada 《Proceedings Mathematical Sciences》2007,117(2):197-203
We show that in n-fold cartesian product, n ≥ 4, a related component need not be a full component. We also prove that when n ≥ 4, uniform boundedness of lengths of geodesics is not a necessary condition for boundedness of solutions of (1) for bounded
function f. 相似文献
2.
Norman Schofield 《Mathematical Social Sciences》1982,3(1):9-32
Various bargaining set theories are compared as predictors of coalition government portfolio distribution. While the kernel and B1-bargaining set are known to exist in voting games with side payments, it is argued that the kernel, and thus B1, are poor predictors. The B2-bargaining set, a subset of B1, when it exists is shown to be a good payoff predictor in a fractionalized and depolarized parliamentary situation (Finland: 1945ndash;1971). Moreover this predictor provides some explanation for the formation of surplus (winning but not minimal) coalitions. 相似文献
3.
We give a special ordered set (SOS) approach that optimizes a discontinuous separable piecewise linear function, even when a mixed-integer programming (MIP) model is not available for it. When a MIP model is available, our SOS model gives a linear programming relaxation bound that is as good as the MIPs. 相似文献
4.
In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties. 相似文献
5.
对任意给定的矩阵A∈Pm×n,B∈Pm×s(s≤n),探讨了矩阵方程AX=B有列满秩解,同时BY=A有行满秩解的充分必要条件,并且给出了基于矩阵的等价、齐次方程组的同解、向量组的等价及线性空间语言的推广. 相似文献
6.
7.
8.
Masahiro Inuiguchi Yukihiro Yoshioka Yoshifumi Kusunoki 《International Journal of Approximate Reasoning》2009,50(8):1199
In this paper, a variable-precision dominance-based rough set approach (VP-DRSA) is proposed together with several VP-DRSA-based approaches to attribute reduction. The properties of VP-DRSA are shown in comparison to previous dominance-based rough set approaches. An advantage of VP-DRSA over variable-consistency dominance-based rough set approach in decision rule induction is emphasized. Some relations among the VP-DRSA-based attribute reduction approaches are investigated. 相似文献
9.
变测度的积分-水平集确定性算法 总被引:3,自引:0,他引:3
提出了一个求总极值的变测度确定性算法,对不同的箱子采用不同的测度,结合确定性数论方法选取一致分布佳点集来代替Monte-Carlo随机投点,使水平值充分地下降,更快地到达全局最小,从而提高算法的计算效率.在文中给出了算法的收敛性证明,并通过数值算例验证了它的有效性. 相似文献
10.
11.
12.
Using support vector machines to learn the efficient set in multiple objective discrete optimization
We propose using support vector machines (SVMs) to learn the efficient set in multiple objective discrete optimization (MODO). We conjecture that a surface generated by SVM could provide a good approximation of the efficient set. As one way of testing this idea, we embed the SVM-approximated efficient set information into a Genetic Algorithm (GA). This is accomplished by using a SVM-based fitness function that guides the GA search. We implement our SVM-guided GA on the multiple objective knapsack and assignment problems. We observe that using SVM improves the performance of the GA compared to a benchmark distance based fitness function and may provide competitive results. 相似文献
13.
J. Rubió-Massegú 《Journal of Difference Equations and Applications》2013,19(6):569-578
In this paper, we find additional conditions to be satisfied by a globally periodic discrete dynamical system, so that its good set (the set of initial conditions providing well-defined solutions) is an open set of ? k or ? k . We will pay especial attention to the rational case and several examples will be given. 相似文献
14.
15.
称双序集E为双序集F用矩形双序集的余扩张,若存在满双序集态射θ:E→F,使对每个α∈F,αθ-1是E的矩形双序子集.本文讨论了拟正则双序集的这种余扩张的性质,给出了它们的结构.作为应用,证明了拟正则的硬双序集实为正则双序集. 相似文献
16.
讨论了更广泛的拟多项式映射,研究了拟多项式的迭代,证明了关于逃逸集,充满 Julia集和Julia集的几个定理.推广了多项式动力系统的相关结果. 相似文献
17.
本文研究了Cantor集和其并的自相似性.利用Cantor展式的方法,得到了关于Cantor集和迭代函数系的一个基本关系:T∪(T+α)为自相似的当且仅当存在一个非负整数n使得α=±(k2-k1)dn.进一步,若T∪(T+α)是自相似的,则它满足开集条件. 相似文献
18.
Heinrich Rolletschek 《Mathematical Logic Quarterly》1995,41(3):395-430
A well-known theorem by Martin asserts that the degrees of maximal sets are precisely the high recursively enumerable (r. e.) degrees, and the same is true with ‘maximal’ replaced by ‘dense simple’, ‘r-maximal’, ‘strongly hypersimple’ or ‘finitely strongly hypersimple’. Many other constructions can also be carried out in any given high r. e. degree, for instance r-maximal or hyperhypersimple sets without maximal supersets (Lerman, Lachlan). In this paper questions of this type are considered systematically. Ultimately it is shown that every conjunction of simplicity- and non-extensibility properties can be accomplished, unless it is ruled out by well-known, elementary results. Moreover, each construction can be carried out in any given high r. e. degree, as might be expected. For instance, every high r. e. degree contains a dense simple, strongly hypersimple set A which is contained neither in a hyperhypersimple nor in an r-maximal set. The paper also contains some auxiliary results, for instance: every r. e. set B can be transformed into an r. e. set A such that (i) A has no dense simple superset, (ii) the transformation preserves simplicity- or non-extensibility properties as far as this is consistent with (i), and (iii) A ?T B if B is high, and A ≥T B otherwise. Several proofs involve refinements of known constructions; relationships to earlier results are discussed in detail. 相似文献
19.
Computing the minimal covering set 总被引:1,自引:0,他引:1
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set–the minimal upward covering set and the minimal downward covering set–unless P equals NP. Finally, we observe a strong relationship between von Neumann–Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other. 相似文献
20.
A. Balbás E. Galperin P. Jiménez. Guerra 《Journal of Optimization Theory and Applications》2005,126(2):247-264
The paper presents a sensitivity analysis of Pareto solutions on the basis of the Karush-Kuhn-Tucker (KKT) necessary conditions applied to nonlinear multiobjective programs (MOP) continuously depending on a parameter. Since the KKT conditions are of the first order, the sensitivity properties are considered in the first approximation. An analogue of the shadow prices, well known for scalar linear programs, is obtained for nonlinear MOPs. Two types of sensitivity are investigated: sensitivity in the state space (on the Pareto set) and sensitivity in the cost function space (on the balance set) for a vector cost function. The results obtained can be used in applications for sensitivity computation under small variations of parameters. Illustrative examples are presented.Research of this author was partially supported by Grant BEC2003-09067-C04-03.Research of this author was partially supported by NSERC Grant RGPIN-3492-00.Research of this author was partially supported by Grant BEC2003-09067-C04-02. 相似文献