Kitahara and Mizuno (2011a) obtained an upper bound for the number of different solutions generated by the primal simplex method with Dantzig’s (the most negative) pivoting rule. In this paper, we obtain an upper bound with any pivoting rule which chooses an entering variable whose reduced cost is negative at each iteration. The bound is applied to special linear programming problems. We also g...

The revised simplex method is often the method of choice when solving large scale sparse linear programming problems, particularly when a family of closely-related problems is to be solved. Each iteration of the revised simplex method requires the solution of two linear systems and a matrix vector product. For a significant number of practical problems the result of one or more of these operati...

In this paper, we describe a new approach of employing Nelder-Mead optimization (NMO) simplex method in Iris image segmentation. In this paper we are using modified way of Libor masek method. In modified Libor masek method mainly in preprocessing phase in segmentation we are using Nelder-Mead search method also called as simplex method for calculation of center coordinates, radius and threshold...

Abstract This article focuses on solving the fuzzy transportation problem using dual approach of simplex. method uses a strong ranking technique for iterative values trapezoidal numbers within problem. Because approach, (in which cost, demand, and supply appear as numbers) is transformed into crisp valued LPP (Linear Programming Problem) employed simplex procedure solving. The earlier task obta...

For the problem of cloud service selection, this paper gives a hybrid algorithm. The hybrid algorithm is composed mainly by Simplex Method and Genetic Algorithm. In this algorithm, a tree traversal sequence encoding scheme and some Simplex Method operations are proposed. The design of the tree traversal sequence encoding can support various types of service combinations. In addition, the hybrid...

Linear programming (LP) is an important field of optimization. Even though, interior point methods are polynomial algorithms, many LP practical problems are solved more efficiently by the primal and dual revised simplex methods (RSM); however, RSM has a poor performance in hard LP problems (HLPP) as in the Klee-Minty Cubes problem. Among LP methods, the hybrid method known as Simplex-Genetic (S...

We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfil this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and al...

We prove that the classic policy-iteration method (Howard 1960) and the original simplex method with the most-negative-reduced-cost pivoting rule (Dantzig 1947) are strongly polynomial-time algorithms for solving the Markov decision problem (MDP) with a fixed discount rate. Furthermore, the computational complexity of the policy-iteration and simplex methods is superior to that of the only know...

Brown alga, Turbinaria conoides was successively extracted with n-hexane, cyclohexane, methanol and ethanol:water (1:1). The extracts were evaluated for antibacterial and antifungal activities by disc diffusion method. Minimal inhibitory concentration was determined for active extracts by broth dilution method. The antiviral activity and cytotoxicity of the extracts were tested in human embryon...

The optimum analytical Conditions with regard to two or more variables can be determined in an unambiguous way by use of the simplex method. The method is particularly applicable to problems involving interacting variables. We describe the application of the simplex technique to the optimization of two procedures on a continuous-flow analyzer (AutoAnalyzer) and to the optimization of chemical v...