Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Linear programming
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Further reading == {{Library resources box |others=no}} {{div col|colwidth=20em}} * Dmitris Alevras and Manfred W. Padberg, ''[https://books.google.com/books?id=RAUyB8NDHJwC Linear Optimization and Extensions: Problems and Solutions]'', Universitext, Springer-Verlag, 2001. (Problems from Padberg with solutions.) <!-- * A. Bachem and W. Kern. ''Linear Programming Duality: An Introduction to Oriented Matroids''. Universitext. Springer-Verlag, 1992. ([[Oriented matroid|Combinatorial]]) --> * {{cite book |first1= Mark |last1=de Berg|first2=Marc |last2=van Kreveld|author-link3=Mark Overmars|first3=Mark |last3=Overmars|first4=Otfried |last4=Schwarzkopf | year = 2000 | title = Computational Geometry | publisher = [[Springer-Verlag]] | edition = 2nd revised | isbn = 978-3-540-65620-3 | url-access = registration | url = https://archive.org/details/computationalgeo00berg }} Chapter 4: Linear Programming: pp. 63–94. Describes a randomized half-plane intersection algorithm for linear programming. * {{cite book|author = [[Michael R. Garey]] and [[David S. Johnson]] | year = 1979 | title = Computers and Intractability: A Guide to the Theory of NP-Completeness | publisher = W.H. Freeman | isbn = 978-0-7167-1045-5| title-link = Computers and Intractability: A Guide to the Theory of NP-Completeness }} A6: MP1: INTEGER PROGRAMMING, pg.245. (computer science, complexity theory) * {{Cite Gartner Matousek 2006}} (elementary introduction for mathematicians and computer scientists) * Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial, ''Interior Point Methods for Linear Optimization'', Second Edition, Springer-Verlag, 2006. (Graduate level) * {{cite book|author = Alexander Schrijver | year = 2003 | title = Combinatorial optimization: polyhedra and efficiency | publisher = Springer}} * Alexander Schrijver, ''Theory of Linear and Integer Programming''. John Wiley & sons, 1998, {{isbn|0-471-98232-6}} (mathematical) * {{cite book|author1=Gerard Sierksma|author2=Yori Zwols|title=Linear and Integer Optimization: Theory and Practice|year=2015|publisher=CRC Press|isbn=978-1-498-71016-9}}; with online solver: https://online-optimizer.appspot.com/ * {{cite book|author1=Gerard Sierksma|author2=Diptesh Ghosh|title=Networks in Action; Text and Computer Exercises in Network Optimization|year=2010|publisher=Springer|isbn=978-1-4419-5512-8}} (linear optimization modeling) * H. P. Williams, ''[https://books.google.com/books?id=YJRh0tOes7UC Model Building in Mathematical Programming]'', Fifth Edition, 2013. (Modeling) * Stephen J. Wright, 1997, ''[https://books.google.com/books?id=oQdBzXhZeUkC Primal-Dual Interior-Point Methods]'', SIAM. (Graduate level) * [[Yinyu Ye]], 1997, ''Interior Point Algorithms: Theory and Analysis'', Wiley. (Advanced graduate-level) * [[Günter M. Ziegler|Ziegler, Günter M.]], Chapters 1–3 and 6–7 in ''Lectures on Polytopes'', Springer-Verlag, New York, 1994. (Geometry) {{div col end}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)