
Applied Integer Programming Modeling and Solution
by Chen, Der-San; Batson, Robert G.; Dang, Yu-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
Buy New
Rent Textbook
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
Author Biography
Robert G. Batson, PhD, PE, is Professor of Construction Engineering at The University of Alabama, where he is also Director of Industrial Engineering Programs. A Fellow of the American Society for Quality Control, Dr. Batson has written numerous journal articles in his areas of research interest, which include operations research, applied statistics, and supply chain management.
Yu Dang, PhD, is Qualitative Manufacturing Analyst at Quickparts.com, a manufacturing services company that provides customers with an online e-commerce system to procure custom manufactured parts. She received her PhD in operations management from The University of Alabama in 2004.
Table of Contents
Modeling | |
Introduction | |
Integer Programming | |
Standard vs. Non-Standard Forms | |
Combinatorial Optimization Problems | |
Successful Integer Programming Applications | |
Text Organization and Chapter Preview | |
Notes | |
Exercises | |
Modeling and Models | |
Assumptions on Mixed Integer Programs | |
Modeling Process | |
Project Selection Problems | |
Knapsack problem | |
Capital budgeting problem | |
Production Planning Problems | |
Workforce/Staff Scheduling Models | |
Fixed-Charge Transportation and Distribution Problems | |
Multi-Commodity Network Flow Problem | |
Network Optimization Problems with Side Constraints | |
Supply Chain Planning Problems | |
Notes | |
Exercises | |
Transformation Using 0-1 Variables | |
Transform Logical (Boolean) Expressions | |
Transform Non-Binary to Binary Variables | |
Transform Piecewise Linear Functions | |
Transform 0-1 Polynomial Functions | |
Transform Nonlinear Functions | |
Transform Non-Simultaneous Constraints | |
Notes | |
Exercises | |
Better Formulation by Preprocessing | |
Better Formulation | |
Automatic Problem Preprocessing | |
Tightening Bounds on Variables | |
Preprocessing Pure 0-1 Integer Programs | |
Decomposing Problem into Independent Sub-Problems | |
Scaling the Coefficient Matrix | |
Notes | |
Exercises | |
Combinatorial Optimization I | |
Introduction | |
Set Covering, Set Partitioning, and Set Packing | |
Matching Problem | |
Cutting Stock Problem | |
Comparisons for Above Problems | |
Computational Complexity of COP | |
Notes | |
Exercises | |
Combinatorial Optimization II | |
Importance of Traveling Salesman Problem | |
Transformations to Traveling Salesman Problem | |
Applications of Traveling Salesman Problem | |
Formulating Asymmetric TSP | |
Formulating Symmetric TSP | |
Notes | |
Exercises | |
Review of Linear Programming and Network Flows | |
Linear Programming--Fundamentals | |
Review of Basic Linear Algebra | |
Uses of Elementary Row Operations | |
The Dual of a Linear Program | |
Relationships between Primal and Dual Solutions | |
Notes | |
Exercises | |
Linear Programming--Geometric Concepts | |
Geometric Solution | |
Convex Sets | |
Describing a Bounded Polyhedron | |
Describing an Unbounded Polyhedron | |
Faces, Facets, Dimension of a Polyhedron | |
Describing a Polyhedron by Facets | |
Correspondence between Algebraic and Geometric Terms | |
Notes | |
Exercises | |
Linear Programming--Solution Methods | |
Linear Programs in Canonical Form | |
Basic Feasible Solutions and Reduced Costs | |
The Simplex Method | |
Interpreting the Simplex Tableau | |
Geometric Interpretation of the Simplex Method | |
The Simplex Method for Upper-Bounded Variables | |
The Dual Simplex Method | |
The Revised Simplex Method | |
Notes | |
Exercises | |
Network Optimization Problems and Solutions | |
Network Fundamentals | |
Class of Easy Network Optimization Problems | |
Totally Unimodular Matrices | |
The Network Simplex Method | |
Solution via LINGO | |
Notes | |
Exercises | |
Solutions | |
Classical Solution Approaches | |
Branch-and-Bound Approach | |
Cutting Plane Approach | |
Group Theoretic Approach | |
Geometric Concepts | |
Notes | |
Exercises | |
Branch-and-Cut Approach | |
Introduction | |
Valid Inequalities | |
Cut Generating Techniques | |
Rounding | |
Cuts Generated from Sets Involving Pure Integer Variables | |
Cuts Generated from Sets Involving Mixed Integer Variables | |
Cuts Generated from 0-1 Knapsack Sets | |
Cuts Generated from Sets Involving 0-1 Coefficients and Variables | |
Cuts Generated from Sets with Special Structures | |
Notes | |
Exercises | |
Branch-and-Price Approach | |
Concepts of Branch-and-Price | |
Dantzig-Wolfe Decomposition | |
Generalized Assignment Problem (GAP) | |
GAP Example | |
Other Application Areas | |
Notes | |
Exercises | |
Solution via Heuristics and Relaxations | |
Introduction | |
Overall Solution Strategy | |
Primal Solution via Heuristics | |
Dual Solution via Relaxations | |
Lagrangian Dual | |
Primal-Dual Solution via Benders? Partitioning | |
Notes | |
Exercises | |
Solutions with Commercial Software | |
Introduction | |
Typical IP Software System Components | |
AMPL Modeling Language | |
LINGO Modeling Language | |
MPL Modeling Language | |
Appendix--Answers to Selected Exercises | |
Bibliography | |
Index | |
Table of Contents provided by Publisher. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.