02181cam a2200349 i 450000100090000000300050000900500170001400800410003101000170007202000310008903500130012004000340013304200080016705000250017508200350020010000600023524500620029526400430035730000470040033600260044733700280047333800270050150400510052850507080057952002350128765000350152265000420155790600450159994200450164495201250168999900170181423293294CSPC20260922032803.0230823s2024 njua b 001 0 eng  a 2023016700 a9789811278730q(paperback) a23293294 aDLCbengerdacDLCdDLCdCSPC apcc00aQA402.5b.N4538 202400a519.72bN344i223/eng/202310121 aNemirovskiĭ, A. S.,q(Arkadiĭ Semenovich),eauthor.10aIntroduction to linear optimization /cArkadi Nemirovski. 1aNew Jersey :bWorld Scientific,c2024. axxii, 626 pages :billustrations ;c24 cm. atextbtxt2rdacontent aunmediatedbn2rdamedia avolumebnc2rdacarrier aIncludes bibliographical references and index.0 aIntroduction to LO: examples of LO models -- Part I. Geometry of linear optimization -- Polyhedral sets and their geometry -- Theory of systems of linear inequalities and duality -- Part II. Classical algorithms of linear optimization: the simplex method -- Simplex method -- The network simplex algorithm -- Part III. Complexity of linear optimization and the ellipsoid method -- Polynomial time solvability of linear optimization -- Part IV. Conic programming and interior point methods -- Conic programming -- Interior point methods for LO and semidefinite optimization -- Appendix A. Prerequisites from linear algebra -- Appendix B. Prerequisites from real analysis -- Appendix C. Symmetric matrics. a"A graduate level, rigorous, and self contained introduction to Linear Optimization. Comes with exercises and solutions. Appendices also provide brief summaries of the pre-requisite results for this book"--cProvided by publisher. 0aLinear programmingvTextbooks. 0aMathematical optimizationvTextbooks. a7bcbccorignewd1eecipf20gy-gencatlg 2ddccBKe23h519.72iN344ikCIRm2024n0 00102ddc4070aCSPCbCSPCcCIRd2026-09-22l0oCIR 519.72 N344i 2024p032587r2026-09-22 03:28:24t1-1w2026-09-22yBK c33373d33373