Linear and integer programming; Theory and practice

作者： Gautam Appa , Gerard Sierksma

关键词: Mathematics 、 Linear algebra 、 Integer points in convex polyhedra 、 Computational complexity theory 、 Integer programming 、 Linear programming 、 Branch and price 、 Simplex algorithm 、 Duality (optimization) 、 Mathematical optimization

摘要: Linear optimisation basic concepts Dantzig's simplex method duality and optimality sensitivity analysis karmarkar's interior path integer linear network models computational complexity issues model building, case studies, advanced techniques solutions to selected exercises. Appendices: algebra convexity graph theory computer package INTPM.