A dual phase-1 algorithm for the simplex method that handles all types of variables is presented. In each iteration it maximizes a piecewise linear function of dual infeasibilities in order to make the largest possible step towards dual feasibility with a selected outgoing variable. The new method can be viewed as a generalization of traditional phase-1 procedures. It is based on the multiple u...

In this paper we generalize the so called rst in last out pivot rule and the most often selected variable pivot rule for the simplex method as proposed in Zhang to the criss cross pivot setting where neither the primal nor the dual feasibility is preserved The nite ness of the new criss cross pivot variants is proven

| Fuzzy logic and fuzzy set theory provide an important framework for representing and managing impre-cision and uncertainty in medical expert systems, but the need remains to optimise such systems to enhance performance. This paper presents a general technique for optimizing fuzzy models in fuzzy expert systems by simulated annealing and N-dimensional hill climbing simplex method. The applicat...

Abstract. We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of the traditionally used dual simplex algorithm to the linear programming relaxations in the root node of the search tree. This means that we use fast approximate solutions to these linear programs instead of exact but slower solutions. We present computational results with the Steiner tree and Max-Cu...

In this paper, the notions of (T, S)-composition matrix and (T, S)interval-valued intuitionistic fuzzy equivalence matrix are introduced where (T, S) is a dual pair of triangular module. They are the generalization of composition matrix and interval-valued intuitionistic fuzzy equivalence matrix. Furthermore, their properties and characterizations are presented. Then a new method based on α̃−mat...

In this paper attention has been paid to the study of multiobjective linear fractional programming problem (MOLFPP) by using fuzzy set theoretic approach. In this approach, MOLFPP is transformed into multiobjective linear programming problem (MOLPP) by suitable transformation. In algorithm-I, MOLFPP is transformed into MOLPP by using fuzzy set theory and the pareto optimal solution of the trans...

In this paper, two-person matrix games is considered whose elements of pay-off matrix are triangular fuzzy numbers (TFNs). To solve such game a new method based on α-cut of TFN is developed for each of the players. In this method, two auxiliary bi-objective linear programming (BOLP) models are derived. Then using average weighted approach these two BOLP models are decomposed into two auxiliary ...

Abstract From the Poisson–Dirichlet diffusions to Z -measure diffusions, they all have explicit transition densities. We show that densities of can also be expressed as a mixture sequence probability measures on Thoma simplex. The coefficients are same in diffusions. This fact will uncovered by dual process method special case where established through an up–down chain Young graph.

We present pure-integer Gomory cuts in a way so that they are derived with respect to a “dual form” pure-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm. The input integer problem is not in standard form, and so the cuts are derived a bit differently. In this manner, we obtain a finitely-terminating version of pure-integer...