Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
An Economic Interpretation of Linear Programming / / by Quirino Paris
| An Economic Interpretation of Linear Programming / / by Quirino Paris |
| Autore | Paris Quirino |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | New York : , : Palgrave Macmillan US : , : Imprint : Palgrave Macmillan, , 2016 |
| Descrizione fisica | 1 online resource (XIX, 454 p.) |
| Disciplina | 519.7/2 |
| Soggetto topico |
Economic theory
Software engineering Econometrics Economic Theory/Quantitative Economics/Mathematical Methods Software Engineering/Programming and Operating Systems |
| ISBN | 1-137-57392-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction to linear programming -- Primal and dual LP problems -- Setting up lp problems -- The transportation and transshipment problems -- Spaces, cones, bases and extreme points -- Solving systems of equations -- Primal simplex algorithm : the price-taking firm -- The dual simplex algorithm -- Linear programming and the lagrangean function -- The artificial variable algorithm -- The artificial constraint algorithm -- The diet problem revisited -- Parametric programming: input demand functions -- Parametric programming: output supply functions -- Dealing with multiple optimal solutions -- Solid waste management -- The choice of techniques in a farm production model -- Cattle ranch management -- The measurement of technical and economic efficiency -- Decentralized economic planning -- Theorems of linear programming. |
| Record Nr. | UNINA-9910254861703321 |
Paris Quirino
|
||
| New York : , : Palgrave Macmillan US : , : Imprint : Palgrave Macmillan, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck
| Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck |
| Autore | Kolman Bernard |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | San Diego, California ; ; London, England : , : Academic Press, , 1995 |
| Descrizione fisica | 1 online resource (474 p.) |
| Disciplina | 519.7/2 |
| Collana | Computer Science and Scientific Computing |
| Soggetto topico | Linear programming |
| Soggetto genere / forma | Electronic books. |
| ISBN | 0-08-053079-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Elementary Linear Programming with Applications; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Prologue; Chapter 0. Review of Linear Algebra (Optional); 0.1 Matrices; 0.2 Gauss-Jordan Reduction; 0.3 The Inverse of a Matrix; 0.4 Subspaces; 0.5 Linear Independence and Basis; Further Reading; Chapter 1. Introduction to Linear Programming; 1.1 The Linear Programming Problem; 1.2 Matrix Notation; 1.3 Geometry of Linear Programming Problems; 1.4 The Extreme Point Theorem; 1.5 Basic Solutions; Further Reading; Chapter 2. The Simplex Method
2.1 The Simplex Method for Problems in Standard Form2.2 Degeneracy and Cycling (Optional); 2.3 Artificial Variables; Further Reading; Chapter 3. Further Topics in Linear Programming; 3.1 Duality; 3.2 The Duality Theorem; 3.3 Computational Relations between the Primal and Dual Problems; 3.4 The Dual Simplex Method; 3.5 The Revised Simplex Method; 3.6 Sensitivity Analysis; 3.7 Computer Aspects (Optional); Further Reading; Chapter 4. Integer Programming; 4.1 Examples; 4.2 Cutting Plane Methods; 4.3 Branch and Bound Methods; 4.4 Computer Aspects (Optional); Further Reading Chapter 5. Special Types of Linear Programming Problems5.1 The Transportation Problem; 5.2 The Assignment Problem; 5.3 Graphs and Networks: Basic Definitions; 5.4 The Maximal Flow Problem; 5.5 The Shortest Route Problem; 5.6 The Critical Path Method; 5.7 Computer Aspects (Optional); APPENDIX A: Karmarkar's Algorithm; APPENDIX B: Microcomputer Software; APPENDIX C: SMPX; Answers to Odd-Numbered Exercises; Index |
| Record Nr. | UNINA-9910480893603321 |
|
Kolman Bernard
|
||
| San Diego, California ; ; London, England : , : Academic Press, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck
| Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck |
| Autore | Kolman Bernard |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | San Diego, California ; ; London, England : , : Academic Press, , 1995 |
| Descrizione fisica | 1 online resource (474 p.) |
| Disciplina | 519.7/2 |
| Collana | Computer Science and Scientific Computing |
| Soggetto topico | Linear programming |
| ISBN | 0-08-053079-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Elementary Linear Programming with Applications; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Prologue; Chapter 0. Review of Linear Algebra (Optional); 0.1 Matrices; 0.2 Gauss-Jordan Reduction; 0.3 The Inverse of a Matrix; 0.4 Subspaces; 0.5 Linear Independence and Basis; Further Reading; Chapter 1. Introduction to Linear Programming; 1.1 The Linear Programming Problem; 1.2 Matrix Notation; 1.3 Geometry of Linear Programming Problems; 1.4 The Extreme Point Theorem; 1.5 Basic Solutions; Further Reading; Chapter 2. The Simplex Method
2.1 The Simplex Method for Problems in Standard Form2.2 Degeneracy and Cycling (Optional); 2.3 Artificial Variables; Further Reading; Chapter 3. Further Topics in Linear Programming; 3.1 Duality; 3.2 The Duality Theorem; 3.3 Computational Relations between the Primal and Dual Problems; 3.4 The Dual Simplex Method; 3.5 The Revised Simplex Method; 3.6 Sensitivity Analysis; 3.7 Computer Aspects (Optional); Further Reading; Chapter 4. Integer Programming; 4.1 Examples; 4.2 Cutting Plane Methods; 4.3 Branch and Bound Methods; 4.4 Computer Aspects (Optional); Further Reading Chapter 5. Special Types of Linear Programming Problems5.1 The Transportation Problem; 5.2 The Assignment Problem; 5.3 Graphs and Networks: Basic Definitions; 5.4 The Maximal Flow Problem; 5.5 The Shortest Route Problem; 5.6 The Critical Path Method; 5.7 Computer Aspects (Optional); APPENDIX A: Karmarkar's Algorithm; APPENDIX B: Microcomputer Software; APPENDIX C: SMPX; Answers to Odd-Numbered Exercises; Index |
| Record Nr. | UNINA-9910784638503321 |
|
Kolman Bernard
|
||
| San Diego, California ; ; London, England : , : Academic Press, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck
| Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck |
| Autore | Kolman Bernard |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | San Diego, California ; ; London, England : , : Academic Press, , 1995 |
| Descrizione fisica | 1 online resource (474 p.) |
| Disciplina | 519.7/2 |
| Collana | Computer Science and Scientific Computing |
| Soggetto topico | Linear programming |
| ISBN | 0-08-053079-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Elementary Linear Programming with Applications; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Prologue; Chapter 0. Review of Linear Algebra (Optional); 0.1 Matrices; 0.2 Gauss-Jordan Reduction; 0.3 The Inverse of a Matrix; 0.4 Subspaces; 0.5 Linear Independence and Basis; Further Reading; Chapter 1. Introduction to Linear Programming; 1.1 The Linear Programming Problem; 1.2 Matrix Notation; 1.3 Geometry of Linear Programming Problems; 1.4 The Extreme Point Theorem; 1.5 Basic Solutions; Further Reading; Chapter 2. The Simplex Method
2.1 The Simplex Method for Problems in Standard Form2.2 Degeneracy and Cycling (Optional); 2.3 Artificial Variables; Further Reading; Chapter 3. Further Topics in Linear Programming; 3.1 Duality; 3.2 The Duality Theorem; 3.3 Computational Relations between the Primal and Dual Problems; 3.4 The Dual Simplex Method; 3.5 The Revised Simplex Method; 3.6 Sensitivity Analysis; 3.7 Computer Aspects (Optional); Further Reading; Chapter 4. Integer Programming; 4.1 Examples; 4.2 Cutting Plane Methods; 4.3 Branch and Bound Methods; 4.4 Computer Aspects (Optional); Further Reading Chapter 5. Special Types of Linear Programming Problems5.1 The Transportation Problem; 5.2 The Assignment Problem; 5.3 Graphs and Networks: Basic Definitions; 5.4 The Maximal Flow Problem; 5.5 The Shortest Route Problem; 5.6 The Critical Path Method; 5.7 Computer Aspects (Optional); APPENDIX A: Karmarkar's Algorithm; APPENDIX B: Microcomputer Software; APPENDIX C: SMPX; Answers to Odd-Numbered Exercises; Index |
| Record Nr. | UNINA-9910808851903321 |
|
Kolman Bernard
|
||
| San Diego, California ; ; London, England : , : Academic Press, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Interior point algorithms : theory and analysis / / Yinyu Ye
| Interior point algorithms : theory and analysis / / Yinyu Ye |
| Autore | Ye Yinyu |
| Pubbl/distr/stampa | New York, : Wiley, c1997 |
| Descrizione fisica | 1 online resource (438 p.) |
| Disciplina | 519.7/2 |
| Collana | Wiley-Interscience series in discrete mathematics and optimization |
| Soggetto topico |
Programming (Mathematics)
Linear programming |
| ISBN |
1-283-29459-1
9786613294593 1-118-03270-5 1-118-03095-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Interior Point Algorithms: Theory and Analysis; Contents; Preface; List of Figures; 1 Introduction and Preliminaries; 1.1 Introduction; 1.2 Mathematical Preliminaries; 1.2.1 Basic notations; 1.2.2 Convex sets; 1.2.3 Real functions; 1.2.4 Inequalities; 1.3 Decision and Optimization Problems; 1.3.1 System of linear equations; 1.3.2 System of nonlinear equations; 1.3.3 Linear least-squares problem; 1.3.4 System of linear inequalities; 1.3.5 Linear programming (LP); 1.3.6 Quadratic programming (QP); 1.3.7 Linear complementarity problem (LCP); 1.3.8 Positive semi-definite programming (PSP)
1.3.9 Nonlinear programming (NP)1.3.10 Nonlinear complementarity problem (NCP); 1.4 Algorithms and Computation Models; 1.4.1 Worst-case complexity; 1.4.2 Condition-based complexity; 1.4.3 Average complexity; 1.4.4 Asymptotic complexity; 1.5 Basic Computational Procedures; 1.5.1 Gaussian elimination method; 1.5.2 Choleski decomposition method; 1.5.3 The Newton method; 1.5.4 Solving ball-constrained linear problem; 1.5.5 Solving ball-constrained quadratic problem; 1.6 Notes; 1.7 Exercises; 2 Geometry of Convex Inequalities; 2.1 Convex Bodies; 2.1.1 Center of gravity; 2.1.2 Ellipsoids 2.2 Analytic Center2.2.1 Analytic center; 2.2.2 Dual potential function; 2.2.3 Analytic central-section inequalities; 2.3 Primal and Primal-Dual Potential Functions; 2.3.1 Primal potential function; 2.3.2 Primal-dual potential function; 2.4 Potential Functions for LP, LCP, and PSP; 2.4.1 Primal potential function for LP; 2.4.2 Dual potential function for LP; 2.4.3 Primal-dual potential function for LP; 2.4.4 Potential function for LCP; 2.4.5 Potential function for PSP; 2.5 Central Paths of LP, LCP, and PSP; 2.5.1 Central path for LP; 2.5.2 Central path for LCP; 2.5.3 Central path for PSP 2.6 Notes2.7 Exercises; 3 Computation of Analytic Center; 3.1 Proximity to Analytic Center; 3.2 Dual Algorithms; 3.2.1 Dual Newton procedure; 3.2.2 Dual potential algorithm; 3.2.3 Central-section algorithm; 3.3 Primal Algorithms; 3.3.1 Primal Newton procedure; 3.3.2 Primal potential algorithm; 3.3.3 Affine scaling algorithm; 3.4 Primal-Dual (Symmetric) Algorithms; 3.4.1 Primal-dual Newton procedure; 3.4.2 Primal-dual potential algorithm; 3.5 Notes; 3.6 Exercises; 4 Linear Programming Algorithms; 4.1 Karmarkar's Algorithm; 4.2 Path-Following Algorithm; 4.3 Potential Reduction Algorithm 4.4 Primal-Dual (Symmetric) Algorithm4.5 Adaptive Path-Following Algorithms; 4.5.1 Predictor-corrector algorithm; 4.5.2 Wide-neighborhood algorithm; 4.6 Affine Scaling Algorithm; 4.7 Extensions to QP and LCP; 4.8 Notes; 4.9 Exercises; 5 Worst-Case Analysis; 5.1 Arithmetic Operation; 5.2 Termination; 5.2.1 Strict complementarity partition; 5.2.2 Project an interior point onto the optimal face; 5.3 Initialization; 5.3.1 A HSD linear program; 5.3.2 Solving (HSD); 5.3.3 Further analysis; 5.4 Infeasible-Starting Algorithm; 5.5 Notes; 5.6 Exercises; 6 Average-Case Analysis; 6.1 One-Step Analysis 6.1.1 High-probability behavior |
| Record Nr. | UNINA-9910876931103321 |
|
Ye Yinyu
|
||
| New York, : Wiley, c1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
An introduction to linear programming and game theory [[electronic resource] /] / Paul R. Thie, G.E. Keough
| An introduction to linear programming and game theory [[electronic resource] /] / Paul R. Thie, G.E. Keough |
| Autore | Thie Paul R. <1938-> |
| Edizione | [3rd ed.] |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley, c2008 |
| Descrizione fisica | 1 online resource (476 p.) |
| Disciplina |
519.7/2
519.72 |
| Altri autori (Persone) | KeoughG. E |
| Soggetto topico |
Linear programming
Game theory |
| ISBN |
1-283-27997-5
9786613279972 1-118-16544-6 1-118-16545-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
An Introduction to Linear Programming and Game Theory; Contents; Preface; 1 Mathematical Models; 1.1 Applying Mathematics; 1.2 The Diet Problem; 1.3 The Prisoner's Dilemma; 1.4 The Roles of Linear Programming and Game Theory; 2 The Linear Programming Model; 2.1 History; 2.2 The Blending Model; 2.3 The Production Model; 2.4 The Transportation Model; 2.5 The Dynamic Planning Model; 2.6 Summary; 3 The Simplex Method; 3.1 The General Problem; 3.2 Linear Equations and Basic Feasible Solutions; 3.3 Introduction to the Simplex Method; 3.4 Theory of the Simplex Method
3.5 The Simplex Tableau and Examples3.6 Artificial Variables; 3.7 Redundant Systems; 3.8 A Convergence Proof; 3.9 Linear Programming and Convexity; 3.10 Spreadsheet Solution of a Linear Programming Problem; 4 Duality; 4.1 Introduction to Duality; 4.2 Definition of the Dual Problem; 4.3 Examples and Interpretations; 4.4 The Duality Theorem; 4.5 The Complementary Slackness Theorem; 5 Sensitivity Analysis; 5.1 Examples in Sensitivity Analysis; 5.2 Matrix Representation of the Simplex Algorithm; 5.3 Changes in the Objective Function; 5.4 Addition of a New Variable 5.5 Changes in the Constant-Term Column Vector5.6 The Dual Simplex Algorithm; 5.7 Addition of a Constraint; 6 Integer Programming; 6.1 Introduction to Integer Programming; 6.2 Models with Integer Programming Formulations; 6.3 Gomory's Cutting Plane Algorithm; 6.4 A Branch and Bound Algorithm; 6.5 Spreadsheet Solution of an Integer Programming Problem; 7 The Transportation Problem; 7.1 A Distribution Problem; 7.2 The Transportation Problem; 7.3 Applications; 8 Other Topics in Linear Programming; 8.1 An Example Involving Uncertainty; 8.2 An Example with Multiple Goals 8.3 An Example Using Decomposition8.4 An Example in Data Envelopment Analysis; 9 Two-Person, Zero-Sum Games; 9.1 Introduction to Game Theory; 9.2 Some Principles of Decision Making in Game Theory; 9.3 Saddle Points; 9.4 Mixed Strategies; 9.5 The Fundamental Theorem; 9.6 Computational Techniques; 9.7 Games People Play; 10 Other Topics in Game Theory; 10.1 Utility Theory; 10.2 Two-Person, Non-Zero-Sum Games; 10.3 Noncooperative Two-Person Games; 10.4 Cooperative Two-Person Games; 10.5 The Axioms of Nash; 10.6 An Example; A Vectors and Matrices; B An Example of Cycling C Efficiency of the Simplex MethodD LP Assistant; E Microsoft Excel and Solver; Bibliography; Solutions to Selected Problems; Index |
| Record Nr. | UNINA-9910139577703321 |
|
Thie Paul R. <1938->
|
||
| Hoboken, N.J., : Wiley, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
An introduction to linear programming and game theory [[electronic resource] /] / Paul R. Thie, G.E. Keough
| An introduction to linear programming and game theory [[electronic resource] /] / Paul R. Thie, G.E. Keough |
| Autore | Thie Paul R. <1938-> |
| Edizione | [3rd ed.] |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley, c2008 |
| Descrizione fisica | 1 online resource (476 p.) |
| Disciplina |
519.7/2
519.72 |
| Altri autori (Persone) | KeoughG. E |
| Soggetto topico |
Linear programming
Game theory |
| ISBN |
1-283-27997-5
9786613279972 1-118-16544-6 1-118-16545-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
An Introduction to Linear Programming and Game Theory; Contents; Preface; 1 Mathematical Models; 1.1 Applying Mathematics; 1.2 The Diet Problem; 1.3 The Prisoner's Dilemma; 1.4 The Roles of Linear Programming and Game Theory; 2 The Linear Programming Model; 2.1 History; 2.2 The Blending Model; 2.3 The Production Model; 2.4 The Transportation Model; 2.5 The Dynamic Planning Model; 2.6 Summary; 3 The Simplex Method; 3.1 The General Problem; 3.2 Linear Equations and Basic Feasible Solutions; 3.3 Introduction to the Simplex Method; 3.4 Theory of the Simplex Method
3.5 The Simplex Tableau and Examples3.6 Artificial Variables; 3.7 Redundant Systems; 3.8 A Convergence Proof; 3.9 Linear Programming and Convexity; 3.10 Spreadsheet Solution of a Linear Programming Problem; 4 Duality; 4.1 Introduction to Duality; 4.2 Definition of the Dual Problem; 4.3 Examples and Interpretations; 4.4 The Duality Theorem; 4.5 The Complementary Slackness Theorem; 5 Sensitivity Analysis; 5.1 Examples in Sensitivity Analysis; 5.2 Matrix Representation of the Simplex Algorithm; 5.3 Changes in the Objective Function; 5.4 Addition of a New Variable 5.5 Changes in the Constant-Term Column Vector5.6 The Dual Simplex Algorithm; 5.7 Addition of a Constraint; 6 Integer Programming; 6.1 Introduction to Integer Programming; 6.2 Models with Integer Programming Formulations; 6.3 Gomory's Cutting Plane Algorithm; 6.4 A Branch and Bound Algorithm; 6.5 Spreadsheet Solution of an Integer Programming Problem; 7 The Transportation Problem; 7.1 A Distribution Problem; 7.2 The Transportation Problem; 7.3 Applications; 8 Other Topics in Linear Programming; 8.1 An Example Involving Uncertainty; 8.2 An Example with Multiple Goals 8.3 An Example Using Decomposition8.4 An Example in Data Envelopment Analysis; 9 Two-Person, Zero-Sum Games; 9.1 Introduction to Game Theory; 9.2 Some Principles of Decision Making in Game Theory; 9.3 Saddle Points; 9.4 Mixed Strategies; 9.5 The Fundamental Theorem; 9.6 Computational Techniques; 9.7 Games People Play; 10 Other Topics in Game Theory; 10.1 Utility Theory; 10.2 Two-Person, Non-Zero-Sum Games; 10.3 Noncooperative Two-Person Games; 10.4 Cooperative Two-Person Games; 10.5 The Axioms of Nash; 10.6 An Example; A Vectors and Matrices; B An Example of Cycling C Efficiency of the Simplex MethodD LP Assistant; E Microsoft Excel and Solver; Bibliography; Solutions to Selected Problems; Index |
| Record Nr. | UNINA-9910830669803321 |
|
Thie Paul R. <1938->
|
||
| Hoboken, N.J., : Wiley, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
An introduction to linear programming and game theory / / Paul R. Thie, G.E. Keough
| An introduction to linear programming and game theory / / Paul R. Thie, G.E. Keough |
| Autore | Thie Paul R. <1938-> |
| Edizione | [3rd ed.] |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley, c2008 |
| Descrizione fisica | 1 online resource (476 p.) |
| Disciplina | 519.7/2 |
| Altri autori (Persone) | KeoughG. E |
| Soggetto topico |
Linear programming
Game theory |
| ISBN |
1-283-27997-5
9786613279972 1-118-16544-6 1-118-16545-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
An Introduction to Linear Programming and Game Theory; Contents; Preface; 1 Mathematical Models; 1.1 Applying Mathematics; 1.2 The Diet Problem; 1.3 The Prisoner's Dilemma; 1.4 The Roles of Linear Programming and Game Theory; 2 The Linear Programming Model; 2.1 History; 2.2 The Blending Model; 2.3 The Production Model; 2.4 The Transportation Model; 2.5 The Dynamic Planning Model; 2.6 Summary; 3 The Simplex Method; 3.1 The General Problem; 3.2 Linear Equations and Basic Feasible Solutions; 3.3 Introduction to the Simplex Method; 3.4 Theory of the Simplex Method
3.5 The Simplex Tableau and Examples3.6 Artificial Variables; 3.7 Redundant Systems; 3.8 A Convergence Proof; 3.9 Linear Programming and Convexity; 3.10 Spreadsheet Solution of a Linear Programming Problem; 4 Duality; 4.1 Introduction to Duality; 4.2 Definition of the Dual Problem; 4.3 Examples and Interpretations; 4.4 The Duality Theorem; 4.5 The Complementary Slackness Theorem; 5 Sensitivity Analysis; 5.1 Examples in Sensitivity Analysis; 5.2 Matrix Representation of the Simplex Algorithm; 5.3 Changes in the Objective Function; 5.4 Addition of a New Variable 5.5 Changes in the Constant-Term Column Vector5.6 The Dual Simplex Algorithm; 5.7 Addition of a Constraint; 6 Integer Programming; 6.1 Introduction to Integer Programming; 6.2 Models with Integer Programming Formulations; 6.3 Gomory's Cutting Plane Algorithm; 6.4 A Branch and Bound Algorithm; 6.5 Spreadsheet Solution of an Integer Programming Problem; 7 The Transportation Problem; 7.1 A Distribution Problem; 7.2 The Transportation Problem; 7.3 Applications; 8 Other Topics in Linear Programming; 8.1 An Example Involving Uncertainty; 8.2 An Example with Multiple Goals 8.3 An Example Using Decomposition8.4 An Example in Data Envelopment Analysis; 9 Two-Person, Zero-Sum Games; 9.1 Introduction to Game Theory; 9.2 Some Principles of Decision Making in Game Theory; 9.3 Saddle Points; 9.4 Mixed Strategies; 9.5 The Fundamental Theorem; 9.6 Computational Techniques; 9.7 Games People Play; 10 Other Topics in Game Theory; 10.1 Utility Theory; 10.2 Two-Person, Non-Zero-Sum Games; 10.3 Noncooperative Two-Person Games; 10.4 Cooperative Two-Person Games; 10.5 The Axioms of Nash; 10.6 An Example; A Vectors and Matrices; B An Example of Cycling C Efficiency of the Simplex MethodD LP Assistant; E Microsoft Excel and Solver; Bibliography; Solutions to Selected Problems; Index |
| Record Nr. | UNINA-9910877401903321 |
|
Thie Paul R. <1938->
|
||
| Hoboken, N.J., : Wiley, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Linear programming [[electronic resource] ] : new frontiers in theory and applications / / Zoltan Adam Mann, editor
| Linear programming [[electronic resource] ] : new frontiers in theory and applications / / Zoltan Adam Mann, editor |
| Pubbl/distr/stampa | Hauppauge, N.Y., : Nova Science Publisher, 2012 |
| Descrizione fisica | 1 online resource (391 p.) |
| Disciplina | 519.7/2 |
| Altri autori (Persone) | MannZoltán Ádám |
| Collana | Mathematics research developments |
| Soggetto topico | Linear programming |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-62417-361-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. I. Theory -- pt. II. Applications in mathematics -- pt. III. Practical applications. |
| Record Nr. | UNINA-9910453212003321 |
| Hauppauge, N.Y., : Nova Science Publisher, 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Linear programming [[electronic resource] ] : new frontiers in theory and applications / / Zoltan Adam Mann, editor
| Linear programming [[electronic resource] ] : new frontiers in theory and applications / / Zoltan Adam Mann, editor |
| Pubbl/distr/stampa | Hauppauge, N.Y., : Nova Science Publisher, 2012 |
| Descrizione fisica | 1 online resource (391 p.) |
| Disciplina | 519.7/2 |
| Altri autori (Persone) | MannZoltán Ádám |
| Collana | Mathematics research developments |
| Soggetto topico | Linear programming |
| ISBN | 1-62417-361-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. I. Theory -- pt. II. Applications in mathematics -- pt. III. Practical applications. |
| Record Nr. | UNINA-9910779782203321 |
| Hauppauge, N.Y., : Nova Science Publisher, 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
