Abstract
Linear optimisation basic concepts Dantzig's simplex method duality and optimality sensitivity analysis karmarkar's interior path method integer linear optimisation linear network models computational complexity issues model building, case studies, and advanced techniques solutions to selected exercises. Appendices: linear algebra convexity graph theory optimisation theory computer package INTPM.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
