Some Additional Views on the Simplex Method and the Geometry of Constraint Space

540 12 556 2 1095 document 556 RR-76-003.pdf application/pdf 95a5abb2ae8cebe20a3b9d73084d5202 MD5 1690134 2016-01-15 01:43:12 https://pure.iiasa.ac.at/id/eprint/540/1/RR-76-003.pdf 540 1 1 text en public

RR-76-003.pdf

14 29366 1 41098 document 29366 indexcodes.txt text/x-c++ afebb73fdf56d5017c64530a2a72e896 MD5 10614 2016-01-15 22:46:47 https://pure.iiasa.ac.at/id/eprint/540/2/indexcodes.txt 540 2 2 text/x-c++ other Generate index codes conversion from text to indexcodes en public

indexcodes.txt

lightbox.jpg

preview.jpg

medium.jpg

small.jpg

RR-76-003.pdf

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/556 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/556 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/556 archive 351 disk0/00/00/05/40 2016-01-15 01:43:12 2021-08-27 17:08:18 2016-01-15 01:43:12 monograph show 2 Orchard-Hays W. AL0305 Some Additional Views on the Simplex Method and the Geometry of Constraint Space pub iis_met iis_cmp prog_sds In Part I, the classical statement of an LP problem is compared with the most general form which general-purpose LP software can usually accept. The latter form is then simplified to the form used internally by such software. An extended matrix representation of the conditions used in the simplex method is given, plus a list of the various outcomes of pivot selection. All this is merely a review and summary in consistent notation. The remainder of Part I views an LP problem as a function of its objective form and parametric algorithms as families of functions. The simplex method, as a process, is also viewed as following a trajectory. The ambiguity of extending this idea to the dual feasible subspace is indicated as well as the difficulty of using this viewpoint for integer programs. Part II begins with a fairly complete list of notation required in discussing details of the simplex method and its variants. Then a series of definitions, lemmas and theorems are given to make precise such notions as basic solution, distinct solution, adjacency, and dual basis. The main result is a clarification of the phenomena of degeneracy and alternate solutions, in both primal and dual senses. In particular, the complementary nature of ambiguous solutions and multiple solutions is shown. Two trivial examples, easily followed, are sufficient to illustrate these ideas. Part III applies the ideas of Part II, plus one other, to the old problems of exploring the vicinity of optimality, resolving revised models from an old basis, and a few special problems for which the simplex method is sometimes useful in a non-LP context. 1976-05 published RR-76-003 RR-76-003 10 2265 public research_report IIASA, Laxenburg, Austria 83 TRUE FALSE info:eu-repo/semantics/book