• Home
  • Search
  • An Improved Simplex-Genetic Method to Solve Hard Linear Programming Problems
  • Open Access IconOpen Access
  • Cite Icon1
  • https://doi.org/10.1007/978-3-540-72590-9_150Copy DOI Icon

An Improved Simplex-Genetic Method to Solve Hard Linear Programming Problems

  • Jan 1, 2007
  • Juan Frausto-Solís +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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 (SG) is very robust to solve HLPP. The objective of SG is to obtain the optimal solution of a HLPP, taking advantages from each one of the combined methods -a genetic algorithm (GA) and the classical primal RSM-. In this paper a new SG method named Improved Simplex Genetic Method (ISG) is presented. ISG combines a GA (with special genetic operators) with both primal and dual RSM. Numerical experimentation using some instances of the Klee-Minty cubes problem shows that ISG has a better performance than both RSM and SG.

Similar Papers
  • Research Article
  • Citations44

Parallel distributed-memory simplex for large-scale stochastic LP problems

  • Feb 20, 2013
  • Computational Optimization and Applications
  • Miles Lubin +3
  • Research Article
  • Citations1

A Decision Support System for Solving Linear Programming Problems

  • Apr 01, 2014
  • International Journal of Decision Support System Technology
  • Nikolaos Ploskas +2
  • Single Book
  • Citations96

Elementary Linear Programming with Applications

  • Jan 01, 1995
  • Bernard Kolman +1
  • Conference Article
  • Citations10

Accommodation of practical constraints by a linear programming jet select

  • Aug 15, 1983
  • E Bergmann +1
  • Research Article
  • Citations26

Revised simplex method and its application for solving fuzzy linear programming problems

  • Jan 01, 2012
  • European J. of Industrial Engineering
  • S.H Nasseri +2
  • Book Chapter

Entropy optimization: Interior point methods; Interior point methods for semidefinite programming; Linear programming: Interior point methods; Linear programming: Karmarkar projective algorithm; Potential reduction methods for linear programming; Sequential quadratic programming: Interior point methods for distributed optimal control problems; Successive quadratic programming: Solution by active sets and interior point methods HOMOGENEOUS SELFDUAL METHODS FOR LINEAR PROGRAMMING

  • Jan 01, 2001
  • Encyclopedia of Optimization
  • Erling D Andersen
  • Research Article
  • Citations186

The quadratic interior point method solving power system optimization problems

  • Jan 01, 1994
  • IEEE Transactions on Power Systems
  • J.A Momoh +3
  • Research Article

Determination of optimal vertices from feasible solutions in unimodular linear programming

  • Mar 01, 1993
  • Deep Blue (University of Michigan)
  • Shinji Mizuno +2
  • Book Chapter
  • Citations1

SPARSITY DIRECTED MIXED INTEGER LINEAR PROGRAMMING APPLIED FOR SOLVING DISCRETE DECISION PROBLEMS IN ELECTRICAL POWER SYSTEMS

  • Jan 01, 1984
  • Proceedings of the Eighth Power Systems Computation Conference Helsinki, 19–24 August 1984
  • E Khodaverdian +1
  • Research Article
  • Citations1

A barrier method for dynamic Leontief-type linear programs

  • Aug 01, 1992
  • European Journal of Operational Research
  • Eugene K Yang +1
  • Research Article
  • Citations90

Design of Open High Magnetic Field MRI Superconducting Magnet With Continuous Current and Genetic Algorithm Method

  • Jun 01, 2009
  • IEEE Transactions on Applied Superconductivity
  • Qiuliang Wang +5
  • Research Article
  • Citations85

A penalty function method based on Kuhn–Tucker condition for solving linear bilevel programming

  • Nov 28, 2006
  • Applied Mathematics and Computation
  • Yibing Lv +3
  • Research Article

A Decomposition-Coordination Algorithm for Large-Scale Linear Programming

  • Aug 01, 1987
  • IFAC Proceedings Volumes
  • Jian-Chao Zeng +2
  • Research Article
  • Citations9

Search-hide games on trees

  • Jan 01, 1995
  • European Journal of Operational Research
  • Buyang Cao
  • Research Article

Aplikasi Program Linier Menggunakan Lindo Dalam Optimasi Keuntungan Pada Omah Jenang di Kabupaten Blitar

  • Dec 24, 2024
  • Unisda Journal of Mathematics and Computer Science (UJMC)
  • Galuh Tyasing Swastika +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.