Abstract: Many problems are naturally modelled as linear optimization problems. The simplex algorithm has long been the most common method to solve these problems. Gabasov and al. use another approach called the adaptive method. It possesses properties that are typical for a primal simplex-method but unlike the latter it does not assume that the initial feasible solution is basic; another principle of transformation of information is used. Also it can stop the solution process according to the suboptimality criterion. Being exact the adaptive method observes all the constraints of the problem.
The XVII Spanish Meeting on Computational Geometry will be held on June 26-28, 2017, at the Faculty of Science, Universidad de Alicante, Alicante, Spain. The main focus of this international conference is on current topics in Discrete and Computational Geometry, including both theoretical and applied results. EGC started in 1990. The intended audience for this conference includes graduate and undergraduate students, researchers in the area or from neighboring disciplines, and members of industry whose work involves geometric algorithms.