
Accession Number : ADA185729
Title : Progress in Mathematical Programming.
Descriptive Note : Research rept.,
Corporate Author : IBM ALMADEN RESEARCH CENTER SAN JOSE CA
Personal Author(s) : Megiddo, Nimrod
PDF Url : ADA185729
Report Date : 04 Mar 1987
Pagination or Media Count : 22
Abstract : Most of the progress reported at the conference was on the theoretical side. Several new polynomial algorithms for linear programming were presented. The common feature to most of the new polynomial algorithms is the pathfollowing aspect. The method of McCormickSofer for convex programming also follows a path. Efforts in the theoretical analysis of algorithms was also reported. Of special interest, although not in the main direction discussed at the conference, was the report by Rinaldi on the practical solution of some large traveling salesman problems. At the time of the conference it was still not clear weather the new algorithms developed since Karmarkar's algorithm would replace the simplex method in practice. Alan Hoffman presented results on conditions under which linear programming problems can be solved by greedy algorithms. In other presentations, FourerGayKernighan presented a programming language (AMPL) for mathematical programming, David Gay presented graphic illustrations of the performance of Karmarkar's algorithm, and James Ho discussed embedding of linear programming in commonly used spreadsheets.
Descriptors : *LINEAR PROGRAMMING, *POLYNOMIALS, ALGORITHMS, EMBEDDING, SIMPLEX METHOD, GRAPHICS, PROGRAMMING LANGUAGES, THEORY, ABSTRACTS, SYMPOSIA
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE