关于区间Katugampola分数阶积分的若干Hermite-Hadamard型不等式

主要引入了区间值函数Katugampola分数阶积分的概念.利用区间分析及区间凸函数理论,得到了区间Katugampola分数阶积分Hermite-Hadamard型不等式.     

On Nested Chain Decompositions of Normalized Matching Posets of Rank 3

In 1975, J. Griggs conjectured that a normalized matching rank-unimodal poset possesses a nested chain decomposition. This elegant conjecture remains open even for posets of rank 3. Recently, Hsu, Logan, and Shahriari have made progress by developing techniques that produce nested chain decompositions for posets with certain rank numbers. As a demonstration of their methods, they prove that the conjecture is true for all rank 3 posets of width at most 7. In this paper, we present new general techniques for creating nested chain decompositions, and, as a corollary, we demonstrate the validity of the conjecture for all rank 3 posets of width at most 11.     

Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative

This paper addresses the optimization problems with interval-valued objective function. For this we consider two types of order relation on the interval space. For each order relation, we obtain KKT conditions using of the concept of generalized Hukuhara derivative ( $gH$ -derivative) for interval-valued functions. The $gH$ -derivative is a concept more general of derivative for this class of functions than other concepts of derivative. We make some comparison with previous result given by other authors and we show some advantages of our result.     

The Karush–Kuhn–Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions

The KKT conditions in multiobjective programming problems with interval-valued objective functions are derived in this paper. Many concepts of Pareto optimal solutions are proposed by considering two orderings on the class of all closed intervals. In order to consider the differentiation of an interval-valued function, we invoke the Hausdorff metric to define the distance between two closed intervals and the Hukuhara difference to define the difference of two closed intervals. Under these settings, we are able to consider the continuity and differentiability of an interval-valued function. The KKT optimality conditions can then be naturally elicited.     

Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogs: the completely positive rank and the completely positive semidefinite rank. We study convergence properties of our hierarchies, compare them extensively to known lower bounds, and provide some (numerical) examples.

     

Duality Theory in Interval-Valued Linear Programming Problems

The weak and strong duality theorems in interval-valued linear programming problems are derived in this paper. The primal and dual interval-valued linear programming problems are formulated by proposing the concept of a scalar (inner) product of closed intervals. We introduce a solution concept that is essentially similar to the notion of nondominated solution in multiobjective programming problems by imposing a partial ordering on the set of all closed intervals. Under these settings, the weak and strong duality theorems for interval-valued linear programming problems are derived naturally.     

On chains and Sperner k-families in ranked posets

A ranked poset P has the Sperner property if the sizes of the largest rank and of the largest antichain in P are equal. A natural strengthening of the Sperner property is condition S: For all k, the set of elements of the k largest ranks in P is a Sperner k-family. P satisfies condition T if for all k there exist disjoint chains in P each of which meets the k largest ranks and which covers the kth largest rank. It is proven here that if P satisfies S, it also satisfies T, and that the converse, although in general false, is true for posets with unimodal Whitney numbers. Conditions S and T and the Sperner property are compared here with two other conditions on posets concerning the existence of certain partitions of P into chains.     

区间信度环境下基于偏好熵的随机格序排列方法

针对偏好优劣关系的信度为区间值的决策偏好系统,运用熵理论提出了一种基于区间值分布偏好向量的决策分析方法。首先,将决策者对方案的偏好描述由:优于、劣于、等价和不可比这四种关系拓广为优于、劣于、等价、无法比较但有上确界、无法比较但有下确界、无法比较且有上确界又下确界、不可比七种偏好关系,并结合区间证据的概念和性质给出了决策偏好系统的区间值分布偏好向量与相对熵的概念、性质。然后,构建了基于偏好熵的证据推理非线性优化模型,通过求解模型,并结合优先原则和集结规则将个人偏好集结成群体偏好,给出了该决策方法的具体步骤,举例说明了方法的可行性。     

On interval-valued nonlinear programming problems

The Wolfe's duality theorems in interval-valued optimization problems are derived in this paper. Four kinds of interval-valued optimization problems are formulated. The Karush-Kuhn-Tucker optimality conditions for interval-valued optimization problems are derived for the purpose of proving the strong duality theorems. The concept of having no duality gap in weak and strong sense are also introduced, and the strong duality theorems in weak and strong sense are then derived naturally.     

Finite Eulerian posets which are binomial, Sheffer or triangular

In this paper we study finite Eulerian posets which are binomial, Sheffer or triangular. These important classes of posets are related to the theory of generating functions and to geometry. The results of this paper are organized as follows:

•

We completely determine the structure of Eulerian binomial posets and, as a conclusion, we are able to classify factorial functions of Eulerian binomial posets.

•

We give an almost complete classification of factorial functions of Eulerian Sheffer posets by dividing the original question into several cases.

•

In most cases above, we completely determine the structure of Eulerian Sheffer posets, a result stronger than just classifying factorial functions of these Eulerian Sheffer posets.

We also study Eulerian triangular posets. This paper answers questions posed by R. Ehrenborg and M. Readdy. This research is also motivated by the work of R. Stanley about recognizing the boolean lattice by looking at smaller intervals.     

Duality Theory for Optimization Problems with Interval-Valued Objective Functions

A solution concept in optimization problems with interval-valued objective functions, which is essentially similar to the concept of nondominated solution in vector optimization problems, is introduced by imposing a partial ordering on the set of all closed intervals. The interval-valued Lagrangian function and interval-valued Lagrangian dual function are also proposed to formulate the dual problem of the interval-valued optimization problem. Under this setting, weak and strong duality theorems can be obtained.     

Interval differential equations with a second type Hukuhara derivative

In this paper, the convergence theorem and continuous dependence on initial data are proved for first order interval differential equations via comparison principle. Our results generalize some known results under weaker conditions. In this study, we exploit a recently introduced concept of interval-valued derivatives.     

Upper bound multigraphs for posets

The study of upper bound graphs of posets can be extended naturally to multigraphs. This paper characterizes such upper bound multigraphs, shows they determine the associated posets up to isomorphism, and extends results of D. Scott to characterize posets having chordal or interval upper bound multigraphs.Research partially supported by Office of Naval Research contract N00014-88-K-0163.     

Methods for nesting rank 3 normalized matching rank-unimodal posets

Anderson and Griggs proved independently that a rank-symmetric-unimodal normalized matching (NM) poset possesses a nested chain decomposition (or nesting), and Griggs later conjectured that this result still holds if we remove the condition of rank-symmetry. We give several methods for constructing nestings of rank-unimodal NM posets of rank 3, which together produce substantial progress towards the rank 3 case of the Griggs nesting conjecture. In particular, we show that certain nearly symmetric posets are nested; we show that certain highly asymmetric rank 3 NM posets are nested; and we use results on minimal rank 1 NM posets to show that certain other rank 3 NM posets are nested.     

On semi-Eulerian partially ordered sets with boundary

Eulerian posets are motivated by the posets from triangulations of spheres; semi-Eulerian posets are motivated by the posets from triangulations of manifolds. Motivated by investigation (Proc. Natl. Acad. Sci. USA 95 (1998) 9093; Adv. Appl. Math. 19 (1997) 144; J. Combin. Theory Ser. A 85 (1999) 1; Adv. Appl. Math. 21 (1998) 22) on the number of faces of triangulations of manifolds with boundary, we introduce semi-Eulerian posets with boundary in this paper, and generalize the reciprocity laws, the Dehn–Sommerville equations, and the combinatorial Alexander duality to semi-Eulerian posets with boundary.     

区间规划问题的最优性条件

区间规划是带有区间参数的规划问题,是一种更易于求解实际问题的柔性规划。它是确定性优化问题的延伸,有区间线性规划和区间非线性规划两种形式。本文讨论了目标函数是区间函数的区间非线性问题。给出了区间规划问题最优性必要条件的较简单证明方法,并利用LU最优解的概念,在一类广义凸函数－(p,r)－ρ－(η,θ)－不变凸函数定义下讨论了最优性充分条件。     

Pattern avoidance and the Bruhat order

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patterns is an order ideal, and the rank generating functions of these ideals are computed. Finally, the Bruhat order in types B and D is studied, and the elements with boolean principal order ideals are characterized and enumerated by length.     

The commutator width of some relatively free lie algebras and nilpotent groups

We determine the exact values of the commutator width of absolutely free and free solvable Lie rings of finite rank, as well as free and free solvable Lie algebras of finite rank over an arbitrary field. We calculate the values of the commutator width of free nilpotent and free metabelian nilpotent Lie algebras of rank 2 or of nilpotency class 2 over an arbitrary field. We also find the values of the commutator width for free nilpotent and free metabelian nilpotent Lie algebras of finite rank at least 3 over an arbitrary field in the case that the nilpotency class exceeds the rank at least by 2. In the case of free nilpotent and free metabelian nilpotent Lie rings of arbitrary finite rank, as well as free nilpotent and free metabelian nilpotent Lie algebras of arbitrary finite rank over the field of rationals, we calculate the values of commutator width without any restrictions. It follows in particular that the free or nonabelian free solvable Lie rings of distinct finite ranks, as well as the free or nonabelian free solvable Lie algebras of distinct finite ranks over an arbitrary field are not elementarily equivalent to each other. We also calculate the exact values of the commutator width of free ?-power nilpotent, free nilpotent, free metabelian, and free metabelian nilpotent groups of finite rank.     

基于区间值直觉模糊集的TOPSIS多属性决策

基于区间值直觉模糊集,提出了一种新的TOPSIS模糊多属性决策方法。首先介绍区间直觉模糊集的概念,定义了两个区间值直觉模糊集之间的距离;然后根据TOPSIS方法的原理,定义了两个区间值直觉模糊集的接近系数,通过计算备选方案到区间值直觉模糊正理想解和负理想解的距离来确定接近系数,从而判断备选方案的优劣次序。最后,通过一个具体实例来说明这种方法的有效性和具体计算过程。     

On differential equations with interval coefficients

In this study, a new approach is developed to solve the initial value problem for interval linear differential equations. In the considered problem, the coefficients and the initial values are constant intervals. In the developed approach, there is no need to define a derivative for interval-valued functions. All derivatives used in the approach are classical derivatives of real functions. The reason for this is that the solution of the problem is defined as a bunch of real functions. Such a solution concept is compatible also with the robust stability concept. Sufficient conditions are provided for the solution to be expressed analytically. In addition, on a numerical example, the solution obtained by the proposed approach is compared with the solution obtained by the generalized Hukuhara differentiability. It is shown that the proposed approach gives a new type of solution. The main advantage of the proposed approach is that the solution to the considered interval initial value problem exists and is unique, as in the real case.