A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is d...

We propose a primal network simplex algorithm for solving the max imum flow problem which chooses as the arc to enter the basis one that is closest to the source node from amongst all possible candidates. We prove that this algorithm requires at most nm pivots to solve a problem with n nodes and m arcs, and give implementat ions of it which run in O(nZm) time. Our algorithm is, as far as we kno...

In this paper we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous peer-to-peer networks with distributed information structures. We propose a distributed version of the well-known simplex algorithm for general degenerate linear programs. A network of agents, running our algorithm, will agree on a common optimal solution, even if the optimal solution is n...

Presents article is deal with optimization of the fixture for end milling process, the most important objective being the minimization of work piece deformation by changing the layout of fixture elements and the clamping forces. The main objective of this work has been the optimization of the fixtures Work piece deformation subjected to clamping forces for End milling operation. The present ana...

An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, four algorithms are compared on uniformly randomly generated test problems. The results are very encouraging for one of the competitive algorithms. In particular, a dual forest exterior point algorithm is on average up...

In this paper, a novel fuzzy simplex sliding-mode controller is proposed for controlling a multivariable nonlinear system. The fuzzy logic control (FLC) algorithm and simplex sliding-mode control (SSMC) theory are integrated to form the fuzzy simplex sliding mode control (FSSMC) scheme which improves the system states response and reduces system states chattering phenomenon. In this paper, at f...

A globally adaptive algorithm for numerical multiple integration over an n-dimensional simplex is described. The algorithm is based on a subdivision strategy that chooses for subdivision at each stage the subregion (of the input simplex) with the largest estimated error. This subregion is divided in half by bisecting an edge. The edge is chosen using information about the smoothness of the inte...

In this paper, we suggest a new pivot rule for the primal simplex algorithm for the minimum cost flow problem, known as the network simplex algorithm. Due to degeneracy, cycling may occur in the network simplex algorithm. By maintaining strongly feasible bases due to Cunningham [1976, 1979], cycling can be prevented but without restrictions on the entering variable, the algorithm can still perf...

The Nelder–Mead algorithm, a longstanding direct search method for unconstrained optimization published in 1965, is designed to minimize a scalar-valued function f of n real variables using only function values, without any derivative information. Each Nelder–Mead iteration is associated with a nondegenerate simplex defined by n+ 1 vertices and their function values; a typical iteration produce...

Linear Programming is a significant and well-studied optimization methodology. Simplex type algorithms have been widely used in Decision Support Systems. The computation of the basis inverse is a crucial step in simplex type algorithms. In this paper, we review and compare three basis update methods. We incorporate these methods on the exterior and the revised simplex algorithm in order to high...