Optimization modeling with spreadsheets / / Kenneth R. Baker |
Autore | Baker Kenneth R. <1943-> |
Edizione | [Third edition.] |
Pubbl/distr/stampa | Hoboken, New Jersey : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (391 p.) |
Disciplina | 005.54 |
Soggetto topico |
Mathematical optimization
Managerial economics - Mathematical models Electronic spreadsheets Programming (Mathematics) |
Soggetto genere / forma | Electronic books. |
ISBN |
1-118-93773-2
1-118-93770-8 |
Classificazione | BUS042000BUS101000TEC009060 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
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: Jet Green; 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; 7.3 LINKING CONSTRAINTS: THE THRESHOLD LEVEL PROBLEM; 7.4 LINKING CONSTRAINTS: THE FACILITY LOCATION MODEL; 7.4.1 Capacitated Version; 7.4.2 Uncapacitated Version 7.5 DISJUNCTIVE CONSTRAINTS: THE MACHINE-SEQUENCING PROBLEM |
Record Nr. | UNINA-9910461012703321 |
Baker Kenneth R. <1943-> | ||
Hoboken, New Jersey : , : Wiley, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Optimization modeling with spreadsheets / / Kenneth R. Baker |
Autore | Baker Kenneth R. <1943-> |
Edizione | [Third edition.] |
Pubbl/distr/stampa | Hoboken, New Jersey : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (391 pages) : illustrations, tables |
Disciplina | 005.54 |
Soggetto topico |
Mathematical optimization
Managerial economics - Mathematical models Electronic spreadsheets Programming (Mathematics) |
ISBN |
1-118-93770-8
1-118-93773-2 |
Classificazione |
417
005.54 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910796084303321 |
Baker Kenneth R. <1943-> | ||
Hoboken, New Jersey : , : Wiley, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Optimization modeling with spreadsheets / / Kenneth R. Baker |
Autore | Baker Kenneth R. <1943-> |
Edizione | [Third edition.] |
Pubbl/distr/stampa | Hoboken, New Jersey : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (391 pages) : illustrations, tables |
Disciplina | 005.54 |
Soggetto topico |
Mathematical optimization
Managerial economics - Mathematical models Electronic spreadsheets Programming (Mathematics) |
ISBN |
1-118-93770-8
1-118-93773-2 |
Classificazione |
417
005.54 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910821140803321 |
Baker Kenneth R. <1943-> | ||
Hoboken, New Jersey : , : Wiley, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Optimization modeling with spreadsheets [[electronic resource] /] / Kenneth R. Baker |
Autore | Baker Kenneth R. <1943-> |
Edizione | [2nd ed.] |
Pubbl/distr/stampa | Hoboken, N.J., : Wiley, 2011 |
Descrizione fisica | 1 online resource (431 p.) |
Disciplina |
005.54
519.6028554 |
Soggetto topico |
Mathematical optimization
Managerial economics - Mathematical models Electronic spreadsheets Programming (Mathematics) |
Soggetto genere / forma | Electronic books. |
ISBN |
1-118-00897-9
1-280-76727-8 9786613678041 0-470-94910-4 0-470-94909-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
CONTENTS; Preface; 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.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 LogicSummary; Exercises; Case: JetGreen; 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 4. Sensitivity Analysis in Linear Programs4.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 5. Linear Programming: Data Envelopment Analysis5.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 Finding Reference Sets and HCUs; 5.6 Assumptions and Limitations of DEA; Summary; Exercises; Case: Branch Performance at Nashville National Bank; Branch Growth at Nashville National Bank; Assessing Branch Productivity; Branch Managers Revolt; Measuring Branches: Available Techniques; The DEA Study; 6. Integer Programming: Binary Choice Models; 6.1 Using Solver with Integer Requirements; 6.2 The Capital Budgeting Problem 6.3 Set Covering6.4 Set Packing; 6.5 Set Partitioning; 6.6 Playoff Scheduling; 6.7 Solving a Large-Scale Set Partitioning Problem; 6.8 The Algorithm for Solving Integer Programs; Summary; Exercises; Case: Motel Location for Nature's Inn; 7. Integer Programming: Logical Constraints; 7.1 Simple Logical Constraints: Exclusivity and Contingency; 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.4.1 Capacitated Version; 7.4.2 Uncapacitated Version 7.5 Disjunctive Constraints: The Machine Sequencing Problem |
Record Nr. | UNINA-9910141010103321 |
Baker Kenneth R. <1943-> | ||
Hoboken, N.J., : Wiley, 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Optimization modeling with spreadsheets [[electronic resource] /] / Kenneth R. Baker |
Autore | Baker Kenneth R. <1943-> |
Edizione | [2nd ed.] |
Pubbl/distr/stampa | Hoboken, N.J., : Wiley, 2011 |
Descrizione fisica | 1 online resource (431 p.) |
Disciplina |
005.54
519.6028554 |
Soggetto topico |
Mathematical optimization
Managerial economics - Mathematical models Electronic spreadsheets Programming (Mathematics) |
ISBN |
1-118-00897-9
1-280-76727-8 9786613678041 0-470-94910-4 0-470-94909-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
CONTENTS; Preface; 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.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 LogicSummary; Exercises; Case: JetGreen; 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 4. Sensitivity Analysis in Linear Programs4.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 5. Linear Programming: Data Envelopment Analysis5.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 Finding Reference Sets and HCUs; 5.6 Assumptions and Limitations of DEA; Summary; Exercises; Case: Branch Performance at Nashville National Bank; Branch Growth at Nashville National Bank; Assessing Branch Productivity; Branch Managers Revolt; Measuring Branches: Available Techniques; The DEA Study; 6. Integer Programming: Binary Choice Models; 6.1 Using Solver with Integer Requirements; 6.2 The Capital Budgeting Problem 6.3 Set Covering6.4 Set Packing; 6.5 Set Partitioning; 6.6 Playoff Scheduling; 6.7 Solving a Large-Scale Set Partitioning Problem; 6.8 The Algorithm for Solving Integer Programs; Summary; Exercises; Case: Motel Location for Nature's Inn; 7. Integer Programming: Logical Constraints; 7.1 Simple Logical Constraints: Exclusivity and Contingency; 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.4.1 Capacitated Version; 7.4.2 Uncapacitated Version 7.5 Disjunctive Constraints: The Machine Sequencing Problem |
Record Nr. | UNINA-9910830414303321 |
Baker Kenneth R. <1943-> | ||
Hoboken, N.J., : Wiley, 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Optimization modeling with spreadsheets [[electronic resource] /] / Kenneth R. Baker |
Autore | Baker Kenneth R. <1943-> |
Edizione | [2nd ed.] |
Pubbl/distr/stampa | Hoboken, N.J., : Wiley, 2011 |
Descrizione fisica | 1 online resource (431 p.) |
Disciplina |
005.54
519.6028554 |
Soggetto topico |
Mathematical optimization
Managerial economics - Mathematical models Electronic spreadsheets Programming (Mathematics) |
ISBN |
1-118-00897-9
1-280-76727-8 9786613678041 0-470-94910-4 0-470-94909-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
CONTENTS; Preface; 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.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 LogicSummary; Exercises; Case: JetGreen; 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 4. Sensitivity Analysis in Linear Programs4.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 5. Linear Programming: Data Envelopment Analysis5.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 Finding Reference Sets and HCUs; 5.6 Assumptions and Limitations of DEA; Summary; Exercises; Case: Branch Performance at Nashville National Bank; Branch Growth at Nashville National Bank; Assessing Branch Productivity; Branch Managers Revolt; Measuring Branches: Available Techniques; The DEA Study; 6. Integer Programming: Binary Choice Models; 6.1 Using Solver with Integer Requirements; 6.2 The Capital Budgeting Problem 6.3 Set Covering6.4 Set Packing; 6.5 Set Partitioning; 6.6 Playoff Scheduling; 6.7 Solving a Large-Scale Set Partitioning Problem; 6.8 The Algorithm for Solving Integer Programs; Summary; Exercises; Case: Motel Location for Nature's Inn; 7. Integer Programming: Logical Constraints; 7.1 Simple Logical Constraints: Exclusivity and Contingency; 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.4.1 Capacitated Version; 7.4.2 Uncapacitated Version 7.5 Disjunctive Constraints: The Machine Sequencing Problem |
Record Nr. | UNINA-9910877214203321 |
Baker Kenneth R. <1943-> | ||
Hoboken, N.J., : Wiley, 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|