SciELO - Scientific Electronic Library Online

 
vol.18 issue2An Adaptive Random Search for Unconstrained Global Optimization author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

Print version ISSN 1405-5546

Abstract

MOSSO-VAZQUEZ, Alejo; JUAREZ-ROMERO, David; CRUZ-CHAVEZ, Marco Antonio  and  SUCAR, Luis Enrique. A KKT Simplex Method for Efficiently Solving Linear Programs for Grasp Analysis Based on the Identification of Nonbinding Constraints. Comp. y Sist. [online]. 2014, vol.18, n.2, pp.225-242. ISSN 1405-5546.  http://dx.doi.org/10.13053/CyS-18-2-2014-029.

A one-phase efficient method to solve linear programming (LP) problems for grasp analysis of robotic hands is proposed. Our method, named as KKT Simplex method, processes free variables directly while choosing the entering and leaving variables, which makes it a one-phase method able to start at any point of the set of feasible solutions. Besides, the proposed method lowers the number of simplex steps by an angular pricing strategy to choose the entering variable. Moreover, the method reduces the size of an LP problem by the identification of nonbinding constraints that preserves the Karush-Kuhn-Tucker (KKT) cone. We developed the KKT Simplex method by incorporating to the well-known revised simplex method the following components: a method to process free variables, a pricing strategy, and an identification method. We solve LP problems of grasp analysis to test the efficiency and the one-phase nature of the proposed method.

Keywords : KKT Simplex method; linear programming; grasp analysis; nonbinding constraints.

        · abstract in Spanish     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License