Optimization Modeling with Spreadsheets

Optimization Modeling with Spreadsheets

Saved in:
Bibliographic Details
Main Author: Baker, Kenneth R.
Format: eBook
Language:English
Published: Newark : John Wiley & Sons, Incorporated, 2015.
Series:New York Academy of Sciences Ser.
Subjects:
Electronic spreadsheets.
Managerial economics > Mathematical models.
Mathematical optimization.
Programming (Mathematics)
Electronic books.
Online Access:Click for online access
Table of Contents:
  • Intro
  • Title Page
  • Copyright Page
  • Contents
  • PREFACE
  • CHAPTER 1 INTRODUCTION TO SPREADSHEET MODELS FOR OPTIMIZATION
  • 1.1 ELEMENTS OF A MODEL
  • 1.2 SPREADSHEET MODELS
  • 1.3 A HIERARCHY FOR ANALYSIS
  • 1.4 OPTIMIZATION SOFTWARE
  • 1.5 USING SOLVER
  • SUMMARY
  • EXERCISES
  • REFERENCES
  • CHAPTER 2 LINEAR PROGRAMMING: ALLOCATION, COVERING, AND BLENDING MODELS
  • 2.1 LINEAR MODELS
  • 2.1.1 Linear Constraints
  • 2.1.2 Formulation
  • 2.1.3 Layout
  • 2.1.4 Results
  • 2.2 ALLOCATION MODELS
  • 2.2.1 The Product Mix Problem
  • 2.3 COVERING MODELS
  • 2.3.1 The Staff-Scheduling Problem
  • 2.4 BLENDING MODELS
  • 2.5 MODELING ERRORS IN LINEAR PROGRAMMING
  • 2.5.1 Exceptions
  • 2.5.2 Debugging
  • 2.5.3 Logic
  • SUMMARY
  • EXERCISES
  • Case: JetGreen
  • CHAPTER 3 LINEAR PROGRAMMING: NETWORK MODELS
  • 3.1 THE TRANSPORTATION MODEL
  • 3.2 THE ASSIGNMENT MODEL
  • 3.3 THE TRANSSHIPMENT MODEL
  • 3.4 FEATURES OF SPECIAL NETWORK MODELS
  • 3.5 BUILDING NETWORK MODELS WITH BALANCE EQUATIONS
  • 3.6 GENERAL NETWORK MODELS WITH YIELDS
  • 3.6.1 Models with Yield Losses
  • 3.6.2 Models with Yield Gains
  • 3.7 GENERAL NETWORK MODELS WITH TRANSFORMED FLOWS
  • SUMMARY
  • EXERCISES
  • Case: Casey's Famous Roast Beef
  • Case: Hollingsworth Paper Company
  • Production and Distribution Facilities
  • Patterns of Distribution
  • Expansion Proposals
  • CHAPTER 4 SENSITIVITY ANALYSIS IN LINEAR PROGRAMS
  • 4.1 PARAMETER ANALYSIS IN THE TRANSPORTATION EXAMPLE
  • 4.2 PARAMETER ANALYSIS IN THE ALLOCATION EXAMPLE
  • 4.3 THE SENSITIVITY REPORT AND THE TRANSPORTATION EXAMPLE
  • 4.4 THE SENSITIVITY REPORT AND THE ALLOCATION EXAMPLE
  • 4.5 DEGENERACY AND ALTERNATIVE OPTIMA
  • 4.6 PATTERNS IN LINEAR PROGRAMMING SOLUTIONS
  • 4.6.1 The Transportation Model
  • 4.6.2 The Product Portfolio Model
  • 4.6.3 The Investment Model
  • 4.6.4 The Allocation Model
  • 4.6.5 The Refinery Model
  • SUMMARY
  • EXERCISES
  • Case: Cox Cable and Wire Company
  • Background
  • The Contract
  • The Analysis
  • CHAPTER 5 LINEAR PROGRAMMING: DATA ENVELOPMENT ANALYSIS
  • 5.1 A GRAPHICAL PERSPECTIVE ON DEA
  • 5.2 AN ALGEBRAIC PERSPECTIVE ON DEA
  • 5.3 A SPREADSHEET MODEL FOR DEA
  • 5.4 INDEXING
  • 5.5 REFERENCE SETS AND HCUs
  • 5.6 ASSUMPTIONS AND LIMITATIONS OF DEA
  • SUMMARY
  • EXERCISES
  • Case: Branch Performance at Nashville National Bank
  • Branch Growth at NNB
  • Assessing Branch Productivity
  • Branch Managers Revolt
  • Measuring Branches: Available Techniques
  • The DEA Study
  • CHAPTER 6 INTEGER PROGRAMMING: BINARY-CHOICE MODELS
  • 6.1 USING SOLVER WITH INTEGER REQUIREMENTS
  • 6.2 THE CAPITAL BUDGETING PROBLEM
  • 6.3 SET COVERING
  • 6.4 SET PACKING
  • 6.5 SET PARTITIONING
  • 6.6 PLAYOFF SCHEDULING
  • 6.7 THE ALGORITHM FOR SOLVING INTEGER PROGRAMS
  • SUMMARY
  • EXERCISES
  • Case: Motel Location for Nature's Inn
  • CHAPTER 7 INTEGER PROGRAMMING: LOGICAL CONSTRAINTS
  • 7.1 SIMPLE LOGICAL CONSTRAINTS: EXCLUSIVITY
  • 7.2 LINKING CONSTRAINTS: THE FIXED COST PROBLEM

Similar Items