A class of fuzzy linear programming (FLP) problems with fuzzy coefficients based on fuzzy relations is introduced, the concepts of feasible and (α, β)-maximal and minimal solutions are defined. The class of crisp (classical) LP problems can be embedded into the class of FLP ones. Moreover, for FLP problems a new concept of duality is introduced and the weak and strong duality theorems are deriv...

Abstract: The adaptive control problem for a jump linear system with quadratic cost functional on infinite time interval is solved in this paper. It is assumed that the coefficients of the state equation are unknown but a compact set that contains the parameters is known. A diminishing excitation accompanies the adaptive control signal to ensure the strong consistency of the weighted least squa...

Semi-Markov decision processes on Borel spaces with deterministic kernels have many practical applications, particularly in inventory theory. Most of the results from general semi-Markov decision processes do not carry over to a deterministic kernel since such a kernel does not provide “smoothness.” We develop infinite dimensional linear programming theory for a general stochastic semi-Markov d...

We consider a new type of monotone nonexpansive mappings in an ordered Banach space X with partial order . This new class of nonlinear mappings properly contains nonexpansive, firmly-nonexpansive and Suzuki-type generalized nonexpansive mappings and partially extends α-nonexpansive mappings. We obtain some existence theorems and weak and strong convergence theorems for the Mann iteration. Some ...

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is based on a discrete logarithm problem on the quotient of certain modules defined through the N\'{e}ron-Severi groups. The discrete logarithm problem is reduci...

Nonstationary infinite-horizon Markov decision processes (MDPs) generalize the most well-studied class of sequential decision models in operations research, namely, that of stationaryMDPs, by relaxing the restrictive assumption that problem data do not change over time. Linearprogramming (LP) has been very successful in obtaining structural insights and devising solutionmeth...

A graph is perfect if for every induced subgraph, the chromatic number is equal to the maximum size of a complete subgraph. The class of perfect graphs is important for several reasons. For instance, many problems of interest in practice but intractable in general can be solved efficiently when restricted to the class of perfect graphs. Also, the question of when a certain class of linear progr...

A fundamental distinction between goods and services is that in the retailing of goods and some services the costs of production and distribution are clearly separable in a non-arbitrary fashion, usually identified as costs of goods sold. They have type I separability. Distribution services, which are also known as attributes, marketing mix or output variables, are produced, distributed and con...

HPIV measurements of a turbulent flow in a square duct are used for studying the 3-D geometric relations between SGS stresses, filtered strain-rates and vorticity. Conditional sampling is performed based on the strain-rate magnitude and SGS dissipation, including negative values. In regions of high dissipation, the flow is more likely to be in axisymmetric expansion with vorticity strongly alig...

Miranda-Thompson majorization is a group-induced cone ordering on $mathbb{R}^{n}$ induced by the group of generalized permutation with determinants equal to 1. In this paper, we generalize Miranda-Thompson majorization on the matrices. For $X$, $Yin M_{m,n}$, $X$ is said to be  Miranda-Thompson majorized by $Y$ (denoted by $Xprec_{mt}Y$) if there exists some $Din rm{Conv(G)}$ s...