{"id":203,"date":"2016-09-15T18:11:05","date_gmt":"2016-09-15T18:11:05","guid":{"rendered":"http:\/\/wordpress.rose-hulman.edu\/rader\/?page_id=203"},"modified":"2016-09-15T19:18:17","modified_gmt":"2016-09-15T19:18:17","slug":"toc","status":"publish","type":"page","link":"https:\/\/wordpress.rose-hulman.edu\/rader\/toc\/","title":{"rendered":"TOC"},"content":{"rendered":"\n\n\n
HOME<\/strong><\/a><\/td>\nTOC<\/strong><\/a><\/td>\nEXAMPLE FILES<\/strong><\/a><\/td>\nSOFTWARE<\/strong><\/a><\/td>\nSOLUTIONS<\/strong><\/a><\/td>\nERRATA<\/strong><\/a><\/td>\nCONTACT INFO<\/strong><\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n
PURCHASE AT:<\/strong><\/span> WILEY<\/span><\/a> I AMAZON<\/span><\/a> I BARNES AND NOBLE<\/span><\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Table of Contents<\/strong><\/p>\n

1. Introduction to Operations Research<\/strong><\/p>\n

1.1\u00a0 What is Deterministic Operations Research?<\/p>\n

1.2\u00a0 Introduction to Optimization Modeling<\/p>\n

1.3\u00a0 Common Classes of Mathematical Programs<\/p>\n

1.4 \u00a0 About this Book
\nExercises<\/p>\n

2. Linear Programming Modeling<\/strong><\/p>\n

2.1\u00a0 Resourse Allocation Models<\/p>\n

2.2\u00a0 Work Scheduling Models<\/p>\n

2.3\u00a0 Models and Data<\/p>\n

2.4\u00a0 Blending Models<\/p>\n

2.5\u00a0 Production Process Models<\/p>\n

2.6 \u00a0Multiperiod Models: Work Scheduling and Inventory<\/p>\n

2.7\u00a0 Linearization of Special Nonlinear Models<\/p>\n

2.8\u00a0 Various Forms of Linear Programs<\/p>\n

2.9\u00a0 Network Flows<\/p>\n

Exercises<\/p>\n

3. Integer Programming Models<\/strong><\/p>\n

3.1\u00a0 Fixed-Charge Models<\/p>\n

3.2\u00a0 Set Covering Models<\/p>\n

3.3\u00a0 Models using Logical Constraints<\/p>\n

3.4\u00a0 Combinatorial Models<\/p>\n

3.5\u00a0 Sports Scheduling and an Introduction to IP Solution Techniques<\/p>\n

Exercises<\/p>\n

4.\u00a0 Real-World Operations Research Applications – an Introduction<\/strong><\/p>\n

4.1\u00a0 Vehicle Routing Problems<\/p>\n

4.2\u00a0 Facility Location and Network Design Models<\/p>\n

4.3\u00a0 Applications in the Airline Industry<\/p>\n

Exercises<\/p>\n

5.\u00a0Introduction to Algorithm Design<\/strong><\/p>\n

5.1\u00a0 Exact and Heuristic Algorithms<\/p>\n

5.2\u00a0 What to Ask when Designing Algorithms?<\/p>\n

5.3\u00a0 Constructive versus Local Search Algorithms<\/p>\n

5.4\u00a0 How Good is our Heuristic Solution?<\/p>\n

5.5\u00a0 Examples of Constructive Methods<\/p>\n

5.6\u00a0 Example of a Local Search Method<\/p>\n

5.7\u00a0 Other Heuristic Methods<\/p>\n

5.8\u00a0 Designing Exact Methods: Optimality Conditions<\/p>\n

Exercises<\/p>\n

6. Improving Search Algorithms and Convexity<\/strong><\/p>\n

6.1\u00a0 Improving Search and Optimal Solutions<\/p>\n

6.2\u00a0 Finding Better Solutions<\/p>\n

6.3\u00a0 Convexity: When does Improving Search imply Global Optimality?<\/p>\n

6.4\u00a0 Farkas’ Lemma: When can no Improving Feasible Direction be found?<\/p>\n

Exercises<\/p>\n

7. Geometry and Algebra of Linear Programs<\/strong><\/p>\n

7.1\u00a0 Geometry and Algebra of “Corner Points”<\/p>\n

7.2\u00a0 Fundamental Theorem of Linear Programming<\/p>\n

7.3\u00a0 Linear Programs in Canonical Form<\/p>\n

Exercises<\/p>\n

8. Solving Linear Programs: Simplex Method<\/strong><\/p>\n

8.1\u00a0 Simplex Method<\/p>\n

8.2\u00a0 Making the Simplex Method More Efficient<\/p>\n

8.3\u00a0 Convergence, Degeneracy, and the Simplex Method<\/p>\n

8.4\u00a0 Finding an Initial Solution: Two-Phase Method<\/p>\n

8.5\u00a0 Bounded Simplex Method<\/p>\n

8.6\u00a0 Computational Issues<\/p>\n

Exercises<\/p>\n

9. Linear Programming Duality<\/strong><\/p>\n

9.1\u00a0 Motivation: Generating Bounds<\/p>\n

9.2\u00a0 Dual Linear Program<\/p>\n

9.3\u00a0 Duality Theorems<\/p>\n

9.4\u00a0 Another Interpretation of the Simplex Method<\/p>\n

9.5\u00a0 Farkas’ Lemma Revisited<\/p>\n

9.6\u00a0 Ecomonic Interpretation of the Dual<\/p>\n

9.7\u00a0 Another Duality Approach: Lagrangian Duality<\/p>\n

Exercises<\/p>\n

10. Sensitivity Analysis of Linear Programs<\/strong><\/p>\n

10.1\u00a0 Graphical Sensitivity Analysis<\/p>\n

10.2\u00a0 Sensitivity Analysis Calculations<\/p>\n

10.3\u00a0 Use of Sensitivity Analysis<\/p>\n

10.4\u00a0 Parametric Programming<\/p>\n

Exercises<\/p>\n

11. Algorithmic Applications of Duality<\/strong><\/p>\n

11.1\u00a0 Dual Simplex Method<\/p>\n

11.2\u00a0 Transportation Problem<\/p>\n

11.3\u00a0 Column Generation<\/p>\n

11.4\u00a0 Dantzig-Wolfe Decomposition<\/p>\n

11.5\u00a0 Primal-Dual Interior Point Method<\/p>\n

Exercises<\/p>\n

12. Network Optimization Algorithms<\/strong><\/p>\n

12.1\u00a0 Introduction to Network Optimization<\/p>\n

12.2\u00a0 Shortest Path Problems<\/p>\n

12.3\u00a0 Maximum Flow Problems<\/p>\n

12.4\u00a0 Minimum Cost Network Flow Problems<\/p>\n

Exercises<\/p>\n

13. Introduction to Integer Programming<\/strong><\/p>\n

13.1\u00a0Basic Definitions and Formulations<\/p>\n

13.2\u00a0 Relaxations and Bounds<\/p>\n

13.3\u00a0 Preprocessing and Probing<\/p>\n

13.4\u00a0 When are Integer Programs “Easy”?<\/p>\n

14. Solving Integer Programs: Exact Methods<\/strong><\/p>\n

14.1\u00a0 Complete Enumeration<\/p>\n

14.2\u00a0 Branch-and-Bound Methods<\/p>\n

14.3\u00a0 Valid Inequalities and Cutting Planes<\/p>\n

14.4\u00a0 Gomory’s Cutting Plane Algorithm<\/p>\n

14.5\u00a0 Valid Inequalities for 0-1 Knapsack Constraints<\/p>\n

14.6\u00a0 Branch-and-Cut Algorithms<\/p>\n

14.7\u00a0 Computational Issues<\/p>\n

Exercises<\/p>\n

15. Solving Integer Programs: Modern Heuristic Techniques<\/strong><\/p>\n

15.1\u00a0 Review of Local Search Methods: Pros and Cons<\/p>\n

15.2\u00a0 Simulated Annealing<\/p>\n

15.3\u00a0 Tabu Search<\/p>\n

15.4\u00a0 Genetic Algorithms<\/p>\n

15.5\u00a0 GRASP Algorithms<\/p>\n

Exercises<\/p>\n

Appendix A: Background Review<\/p>\n

A.1\u00a0 Basic Notation<\/p>\n

A.2\u00a0 Graph Theory<\/p>\n

A.3\u00a0 Linear Algebra<\/p>\n

References<\/p>\n

Index<\/p>\n","protected":false},"excerpt":{"rendered":"

HOME TOC EXAMPLE FILES SOFTWARE SOLUTIONS ERRATA CONTACT INFO PURCHASE AT: WILEY I AMAZON I BARNES AND NOBLE Table of Contents 1. Introduction to Operations Research 1.1\u00a0 What is Deterministic Operations Research? 1.2\u00a0 Introduction to Optimization Modeling 1.3\u00a0 Common Classes of Mathematical Programs 1.4 \u00a0 About this Book Exercises 2. Linear Programming Modeling 2.1\u00a0 Resourse…<\/p>\n","protected":false},"author":812,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-203","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/pages\/203","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/users\/812"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/comments?post=203"}],"version-history":[{"count":4,"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/pages\/203\/revisions"}],"predecessor-version":[{"id":335,"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/pages\/203\/revisions\/335"}],"wp:attachment":[{"href":"https:\/\/wordpress.rose-hulman.edu\/rader\/wp-json\/wp\/v2\/media?parent=203"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}