Open AccessA “feasible direction” search for Lineal Programming problem solving
Author(s) -
Jaime U Malpica Angarita
Publication year - 2003
Publication title -
ingeniería e investigación/ingeniería e investigación
Language(s) - English
Resource type - Journals
eISSN - 2248-8723
pISSN - 0120-5609
DOI - 10.15446/ing.investig.v23n3.14703
Subject(s) - interior point method , linear programming , hyperplane , mathematical optimization , mathematics , karush–kuhn–tucker conditions , feasible region , polytope , linear subspace , boundary (topology) , maximization , regular polygon , backtracking , cutting plane method , combinatorics , integer programming , geometry , mathematical analysis