Home Page Icon
Home Page
Table of Contents for
COVER
Close
COVER
by Kenneth R. Baker
Optimization Modeling with Spreadsheets, 3rd Edition
COVER
TITLE PAGE
PREFACE
WHY MODEL BUILDING?
WHY SPREADSHEETS?
WHAT’S SPECIAL?
WHAT’S NEW?
THE AUDIENCE
ACKNOWLEDGMENTS
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
2 LINEAR PROGRAMMING: ALLOCATION, COVERING, AND BLENDING MODELS
2.1 LINEAR MODELS
2.2 ALLOCATION MODELS
2.3 COVERING MODELS
2.4 BLENDING MODELS
2.5 MODELING ERRORS IN LINEAR PROGRAMMING
SUMMARY
EXERCISES
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.7 GENERAL NETWORK MODELS WITH TRANSFORMED FLOWS
SUMMARY
EXERCISES
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
SUMMARY
EXERCISES
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
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
7 INTEGER PROGRAMMING: LOGICAL CONSTRAINTS
7.1 SIMPLE LOGICAL CONSTRAINTS: EXCLUSIVITY
7.2 LINKING CONSTRAINTS: THE FIXED COST PROBLEM
7.3 LINKING CONSTRAINTS: THE THRESHOLD LEVEL PROBLEM
7.4 LINKING CONSTRAINTS: THE FACILITY LOCATION MODEL
7.5 DISJUNCTIVE CONSTRAINTS: THE MACHINE-SEQUENCING PROBLEM
7.6 TOUR CONSTRAINTS: THE TRAVELING SALESPERSON PROBLEM
SUMMARY
EXERCISES
8 NONLINEAR PROGRAMMING
8.1 ONE-VARIABLE MODELS
8.2 LOCAL OPTIMA AND THE SEARCH FOR AN OPTIMUM
8.3 TWO-VARIABLE MODELS
8.4 NONLINEAR MODELS WITH CONSTRAINTS
8.5 LINEARIZATIONS
SUMMARY
EXERCISES
9 HEURISTIC SOLUTIONS WITH THE EVOLUTIONARY SOLVER
9.1 FEATURES OF THE EVOLUTIONARY SOLVER
9.2 AN ILLUSTRATIVE EXAMPLE: NONLINEAR REGRESSION
9.3 THE MACHINE-SEQUENCING PROBLEM REVISITED
9.4 THE TRAVELING SALESPERSON PROBLEM REVISITED
9.5 BUDGET ALLOCATION
9.6 TWO-DIMENSIONAL LOCATION
9.7 LINE BALANCING
9.8 GROUP ASSIGNMENT
SUMMARY
EXERCISES
Appendix 1: SUPPLEMENTAL FILES AND SOFTWARE
A1.1 SUPPLEMENTAL Microsoft® Office Excel® FILES
A1.2 ANALYTIC SOLVER PLATFORM FOR EDUCATION SOFTWARE
A1.3 OPENSOLVER SOFTWARE
Appendix 2: GRAPHICAL METHODS FOR LINEAR PROGRAMMING
A2.1 AN EXAMPLE
A2.2 GENERALITIES
Appendix 3: THE SIMPLEX METHOD
A3.1 AN EXAMPLE
A3.2 VARIATIONS OF THE ALGORITHM
REFERENCES
INDEX
END USER LICENSE AGREEMENT
Search in book...
Toggle Font Controls
Playlists
Add To
Create new playlist
Name your new playlist
Playlist description (optional)
Cancel
Create playlist
Sign In
Email address
Password
Forgot Password?
Create account
Login
or
Continue with Facebook
Continue with Google
Sign Up
Full Name
Email address
Confirm Email Address
Password
Login
Create account
or
Continue with Facebook
Continue with Google
Next
Next Chapter
Optimization Modeling with Spreadsheets
Add Highlight
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click
here
login for view all page.
Day Mode
Cloud Mode
Night Mode
Reset