We study continuous lattices with maps that preserve all suprema rather than only directed ones. We introduce the (full) subcategory of FS-lattices, which turns out to be ∗-autonomous, and in fact maximal with this property. FS-lattices are studied in the presence of distributivity and algebraicity. The theory is extremely rich with numerous connections to classical Domain Theory, complete dist...

qi = 1, pA ≥ v ≥ Aq. The number v is known as the value of game. The pair (p, q) is known as an equilibrium for the matrix game. As usual, x ≥ 0 means that every entry of the vector x is ≥ 0. We write y ≤ t for a vector y and a number t if every entry of y is ≤ t. We go even further in abusing notation, denoting by y− t the vector obtaining from y by subtracting t from every entry. Similarly we...

It is well known that every l∞ linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to an l∞ linear approximation problem. Now we recall relevent definitions. An affine function of variables x1, . . . , xn is b0 + c1x1 + · · · + cnxn where b0, ci are given numbers. A linear constraint is any of the following c...

Daniels (JAP 1982) gave a saddlepoint approximation to the probabilities of a general birth process. This paper gives an improved approximation which is only slightly more complex than Daniels’ approximation and which has considerably reduced relative error in most cases. The new approximation has the characteristic that it is exact whenever the birth rates can be reordered into a linear increa...

in this paper, the magnetohydrodynamic (mhd) boundary layer flow over a nonlinear porous stretching sheet is investigated by employing the homotopy perturbation transform method (hptm) and the pade´ approximation. the numerical solution of the governing non-linear problem is developed. comparison of the present solution is made with the existing solution and excellent agreement is noted. graphi...

We study combinatorial optimization problems in which a set of distributed agents must achieve a global objective using only local information. Papadimitriou and Yannakakis [Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 121–129] initiated the study of such problems in a framework where distributed decision-makers must generate feasible solutions to positive linear prog...