The dual simplex method is frequently the most efficient technique for solving linear programming (LP) problems. This thesis describes an efficient implementation of the sequential dual simplex method and the design and development of two parallel dual simplex solvers. In serial, many advanced techniques for the (dual) simplex method are implemented, including sparse LU factorization, hyper-spa...

Stressors within humans and other species activate Hsp72 and Hsp90α mRNA transcription, although it is unclear which environmental temperature or treadmill gradient induces the largest increase. To determine the optimal stressor for priming the Hsp system, physically active but not heat-acclimated participants (19.8 ± 1.9 and 20.9 ± 3.6 yr) exercised at lactate threshold in either temperate (20...

L1 norm estimator has been widely used as a robust parameter estimation method for outlier detection. Different algorithms have been applied for L1 norm minimization among which the linear programming problem based on the simplex method is well known. In the present contribution, in order to solve an L1 norm minimization problem in a linear model, an interior point algorithm is developed which ...

Although the balance difficulties accompanying vestibular loss are well known, the underlying cause remains unclear. We examined the role of vestibular inputs in the automatic postural response (APR) to pitch and roll rotations of the support surface in freely standing cats before and in the first week after bilateral labyrinthectomy. Support surface rotations accelerate the body center of mass...

Humans and other animals exchange gravitational potential energy (GPE) and kinetic energy (KE) of the center of mass during level walking. How effective is this energy exchange during downhill and uphill walking? Based on previous reports and our own reasoning, we expected that during downhill walking, the possibility for mechanical energy exchange would be enhanced and during uphill walking, t...

In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...

We will derive two results of the primal simplex method by constructing simple LP instances on 0-1 polytopes. First, for any 0-1 polytope and any of its two vertices, we can construct an LP instance for which the simplex method finds a path between them, whose length is at most the dimension of the polytope. This proves a well-known result that the diameter of any 0-1 polytope is bounded by its...