We prove that the simplex method with the highest gain/most-negative-reduced cost pivoting rule converges in strongly polynomial time for deterministic Markov decision processes (MDPs) regardless of the discount factor. For a deterministic MDP with n states and m actions, we prove the simplex method runs in O(nm log n) iterations if the discount factor is uniform and O(nm log n) iterations if e...

The concept of duality plays an important role in optimization theory. This paper discusses some relations between primal and dual nonlinear programming problems in fuzzy environment. Here, fuzzy feasible region for a general fuzzy nonlinear programming is formed and the concept of fuzzy feasible solution is defined. First order dual relation for fuzzy nonlinear programming problem is studied.

Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, mainly due to inefficiencies of barrier methods. Interior point methods became quit popular again after 1984, when Karmarkar announced a fast polynomial-time interior method for nonlinear programming [Karmarkar, 1984]. In this section we present primal-dual in...

In this note we consider the notion of intuitionistic fuzzy (weak) dual hyper K-ideals and obtain related results. Then we classify this notion according to level sets. After that we determine the relationships between intuitionistic fuzzy (weak) dual hyper K-ideals and intuitionistic fuzzy (weak) hyper K-ideals. Finally, we define the notion of the product of two intuitionistic fuzzy (weak) du...

In this paper, we develop a hybrid state-space fuzzy model-based controller with dual-rate sampling for digital control of chaotic systems. Takagi–Sugeno (TS) fuzzy model is used to model the chaotic dynamic system and the extended paralleldistributed compensation technique is proposed and formulated for designing the fuzzy model-based controller under stability conditions. The optimal regional...

Standard intuitionistic fuzzy arithmetic operations have certain problems in division and subtraction operations. Ezzati et al. (2014) defined a new operation on symmetric trapezoidal intuitionistic fuzzy numbers in which the properties ≈ 1 and ≈ 0 are satisfied. In this paper, the new operations according to Ezzati et al. (2014) are extended to symmetric trapezoidal intuitionistic fuzzy number...

The traditional perturbution (or lexicographic) methods for resolving degeneracy in linear programming impose decision rules that eliminate ties in the simplex ratio rule and, therefore, restrict the choice of exiting basic variables. Bland's combinatorial pivoting rule also restricts the choice of exiting variables. Using ideas from parametric linear programming, we develop anti-cycling pivoti...

The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...

We show that the Gurarij space $\mathbb{G}$ has extremely amenable automorphism group. This answers a question of Melleray and Tsankov. also compute universal minimal flow group Poulsen simplex $\mathbb{P}$ we prove it consists canonical action on itself. Conley Törnquist. pointwise stabilizer any closed proper face is amenable. Similarly, biface unit ball dual (the Lusky simplex) These results...

The basis matrices corresponding to consecutive iterations of the simplex method only differ in a single column. This fact is commonly exploited in current LP solvers to avoid having to compute a new factorization of the basis at every iteration. Instead, a previous factorization is updated to reflect the modified column. Several methods are known for performing the update, most prominently the...