An improved initial basis for the simplex algorithm
HV Junior, MPE Lins - Computers & Operations Research, 2005 - Elsevier
A lot of research has been done to find a faster (polynomial) algorithm that can solve linear
programming (LP) problems. The main branch of this research has been devoted to interior …
programming (LP) problems. The main branch of this research has been devoted to interior …
A note on “an improved initial basis for the simplex algorithm”
JF Hu - Computers & operations research, 2007 - Elsevier
In this note, we show a mathematical error in paper (“An improved initial basis for the
simplex algorithm”(Junior HV, Lins MPE. An improved initial basis for the simplex algorithm …
simplex algorithm”(Junior HV, Lins MPE. An improved initial basis for the simplex algorithm …
A simple direct cosine simplex algorithm
WC Yeh, HW Corley - Applied mathematics and Computation, 2009 - Elsevier
Linear programming (LP) is the core model of constrained optimization. The Simplex method
(Simplex in short) has been proven in practice to perform very well in small-or medium-sized …
(Simplex in short) has been proven in practice to perform very well in small-or medium-sized …
[图书][B] Constraint optimal selection techniques (costs) for a class of linear programming problems
TK Sung - 2006 - search.proquest.com
This dissertation describes two classes of Constraint Optimal Selection Techniques
(COSTs). An algorithm of each type is developed for solving nonnegative linear …
(COSTs). An algorithm of each type is developed for solving nonnegative linear …
Cosine policy iteration for solving infinite-horizon Markov decision processes
Police Iteration (PI) is a widely used traditional method for solving Markov Decision
Processes (MDPs). In this paper, the cosine policy iteration (CPI) method for solving …
Processes (MDPs). In this paper, the cosine policy iteration (CPI) method for solving …
An Improved Simplex-Genetic Method to Solve Hard Linear Programming Problems
J Frausto-Solís, A Nieto-Yáñez - … Conference, Beijing, China, May 27-30 …, 2007 - Springer
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 …
methods are polynomial algorithms, many LP practical problems are solved more efficiently …
Markov decision processes for infinite horizon problems solved with the cosine simplex method
J Frausto-Solis, E Santiago - Optimization, 2012 - Taylor & Francis
This article presents a new method of linear programming (LP) for solving Markov decision
processes (MDPs) based on the simplex method (SM). SM has shown to be the most …
processes (MDPs) based on the simplex method (SM). SM has shown to be the most …