In this paper we discuss an application of the Simplex method in checking software safety — the application in automated detection of buffer overflows in C programs. This problem is important because buffer overflows are suitable targets for hackers’ security attacks and sources of serious programs’ misbehavior. We also describe our implementation, including a system for generating software cor...

The integral simplex method for set partitioning problems allows only pivots-on-one to be made, which results in a primal all-integer method. In this technical note we outline how to tailor the column generation principle to this method. Because of the restriction to pivots-onone, only local optimality can be guaranteed, and to ensure global optimality we consider the use of implicit enumeratio...

Combining meta-heuristics with local search methods is one approach that recently has drawn much attention to design more efficient methods for solving continuous global optimization problems. In this paper, a new algorithm called Simplex Coding Genetic Algorithm (SCGA) is proposed by hybridizing genetic algorithm and simplexbased local search method called Nelder-Mead method. In the SCGA, each...

Although many solution methods are available for the linear programming problem, the simplex method is undoubtedly the most widely used one for its simplicity. In this paper, we propose an implementation of the simplex method on freed-size hypercubes. A partitioning technique and a mapping technique are presented to fit largo~sL~ problem instances into relatively small-size hypercubes. Two case...

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...

Pivot selection, the choice of entering variable, is a crucial step in the Simplex method. Good choices can lead to a significant speedup in finding a solution to a linear program, while poor choices lead to very slow or even nonterminal progress. This report explores three widely used pivot heuristics: the Dantzig rule, Steepest-Edge, and Devex. The theoretical underpinnings of each are studie...