A platform for research: civil engineering, architecture and urbanism
A new algorithm for solving linear programming problems
Linear programming (LP) is one of the most widely-applied techniques in operations research. Many methods have been developed and several others are being proposed for solving LP problems, including the famous simplex method and interior point algorithms. This study was aimed at introducing a new method for solving LP problems. The proposed algorithm starts from an interior point and then carries out orthogonal projections using parametric straight lines to move between the interior and polyhedron frontier defining the feasible region until reaching the extreme optimal point.
A new algorithm for solving linear programming problems
Linear programming (LP) is one of the most widely-applied techniques in operations research. Many methods have been developed and several others are being proposed for solving LP problems, including the famous simplex method and interior point algorithms. This study was aimed at introducing a new method for solving LP problems. The proposed algorithm starts from an interior point and then carries out orthogonal projections using parametric straight lines to move between the interior and polyhedron frontier defining the feasible region until reaching the extreme optimal point.
A new algorithm for solving linear programming problems
Andrés Leonardo Ramírez Leal (author) / Oscar Yecid Buitrago Suescún (author) / Rodrigo Alberto Britto Agudelo (author)
2012
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Solving Unconfined Groundwater Flow Management Problems with Successive Linear Programming
Online Contents | 2008
|Solving Unconfined Groundwater Flow Management Problems with Successive Linear Programming
British Library Online Contents | 2008
|Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
Online Contents | 2017
|A high order implicit algorithm for solving instationary non-linear problems
British Library Online Contents | 2002
|British Library Online Contents | 2015
|