Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/5/84; site gloria.UUCP Path: utzoo!watmath!clyde!bonnie!akgua!whuxlm!harpo!decvax!genrad!mit-eddie!godot!harvard!seismo!rochester!rocksvax!rocksanne!sunybcs!gloria!colonel From: colonel@gloria.UUCP (George Sicherman) Newsgroups: net.math Subject: what is the Khatchian Algorithm? Message-ID: <743@gloria.UUCP> Date: Wed, 26-Dec-84 12:18:01 EST Article-I.D.: gloria.743 Posted: Wed Dec 26 12:18:01 1984 Date-Received: Fri, 28-Dec-84 08:05:43 EST References: <2820@ucla-cs.ARPA> <341@lll-crg.ARPA> Organization: SUNY-Buffalo Confuser Science Lines: 18 > > There has been a great deal of media "hype" on this algorithm, somewhat > > similar to the hype which followed the Khatchian algorithm 4 years > > ago, and which turned out to be highly exaggerated. The value of the > > Karmaker algorithm remains to be seen. > > What was the Khatchian algorithm? How was it hyped and what were its > limitations? Khatchian's algorithm solved the linear programming problem in polynomial time (third or fourth power, I think). This is better than the worst case for the Simplex Method, which uses exponential time. It's an important theoretical result. It's unimportant in practice, since the Simplex Method usually runs in linear time. The mass media cannot distinguish between theoretical results and practical results. -- Col. G. L. Sicherman ...seismo!rochester!rocksanne!rocksvax!sunybcs!gloria!colonel