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.
Building and solving mathematical programming models in engineering and science [[electronic resource] /] / Enrique Castillo ... [et al.]
| Building and solving mathematical programming models in engineering and science [[electronic resource] /] / Enrique Castillo ... [et al.] |
| Pubbl/distr/stampa | New York, : Wiley, 2002 |
| Descrizione fisica | 1 online resource (568 p.) |
| Disciplina |
620.0015197
620/.001/5197 |
| Altri autori (Persone) | CastilloEnrique <1946-> |
| Collana | Pure and applied mathematics |
| Soggetto topico |
Programming (Mathematics)
Engineering models |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-33192-6
9786613331922 0-471-22529-0 0-471-46165-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Building and Solving Mathematical Programming Models in Engineering and Science; Contents; Preface; I Models; 1 Linear Programming; 1.1 Introduction; 1.2 The Transportation Problem; 1.3 The Production Scheduling Problem; 1.3.1 Production Scheduling Problem 1; 1.4 The Diet Problem; 1.5 The Network Flow Problem; 1.6 The Portfolio Problem; 1.7 Scaffolding System; 1.8 Electric Power Economic Dispatch; Exercises; 2 Mixed-Integer Linear Programming; 2.1 Introduction; 2.2 The 0-1 Knapsack Problem; 2.3 Identifying Relevant Symptoms; 2.4 The Academy Problem; 2.5 School Timetable Problem
2.6 Models of Discrete Location2.7 Unit Commitment of Thermal Power Units; Exercises; 3 Nonlinear Programming; 3.1 Introduction; 3.2 Some Geometrically Motivated Examples; 3.2.1 The Postal Package Example; 3.2.2 The Tent Example; 3.2.3 The Lightbulb Example; 3.2.4 The Surface Example; 3.2.5 The Moving Sand Example; 3.3 Some Mechanically Motivated Examples; 3.3.1 The Cantilever Beam Example; 3.3.2 The Two-Bar Truss Example; 3.3.3 The Column Example; 3.3.4 Scaffolding System; 3.4 Some Electrically Motivated Examples; 3.4.1 Power Circuit State Estimation; 3.4.2 Optimal Power Flow 3.5 The Matrix Balancing Problem3.6 The Traffic Assignment Problem; Exercises; II Methods; 4 An Introduction to Linear Programming; 4.1 Introduction; 4.2 Problem Statement and Basic Definitions; 4.3 Linear Programming Problem in Standard Form; 4.3.1 Transformation to Standard Form; 4.4 Basic Solutions; 4.5 Sensitivities; 4.6 Duality; 4.6.1 Obtaining the Dual from a Primal in Standard Form; 4.6.2 Obtaining the Dual Problem; 4.6.3 Duality Theorems; Exercises; 5 Understanding the Set of All Feasible Solutions; 5.1 Introduction and Motivation; 5.2 Convex Sets; 5.3 Linear Spaces 5.4 Polyhedral Convex Cones5.5 Polytopes; 5.6 Polyhedra; 5.6.1 General Representation of Polyhedra; 5.7 Bounded and Unbounded LPP; Exercises; 6 Solving the Linear Programming Problem; 6.1 Introduction; 6.2 The Simplex Method; 6.2.1 Motivating Example; 6.2.2 General Description; 6.2.3 Initialization Stage; 6.2.4 Elemental Pivoting Operation; 6.2.5 Identifying an Optimal Solution; 6.2.6 Regulating Iteration; 6.2.7 Detecting Unboundedness; 6.2.8 Detecting Infeasibility; 6.2.9 Standard Iterations Stage; 6.2.10 The Revised Simplex Algorithm; 6.2.11 Some Illustrative Examples 6.3 The Exterior Point Method6.3.1 Initial Stage; 6.3.2 Regulating Stage; 6.3.3 Detecting Infeasibility and Unboundedness; 6.3.4 Standard Iterations Stage; 6.3.5 The EPM Algorithm; 6.3.6 Some Illustrative Examples; Exercises; 7 Mixed-Integer Linear Programming; 7.1 Introduction; 7.2 The Branch-Bound Method; 7.2.1 Introduction; 7.2.2 The BB Algorithm for MILPP; 7.2.3 Branching and Processing Strategies; 7.2.4 Other Mixed-Integer Linear Programming Problems; 7.3 The Gomory Cuts Method; 7.3.1 Introduction; 7.3.2 Cut Generation; 7.3.3 The Gomory Cuts Algorithm for an ILPP; Exercises 8 Optimality and Duality in Nonlinear Programming |
| Record Nr. | UNINA-9910139566203321 |
| New York, : Wiley, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Building and solving mathematical programming models in engineering and science [[electronic resource] /] / Enrique Castillo ... [et al.]
| Building and solving mathematical programming models in engineering and science [[electronic resource] /] / Enrique Castillo ... [et al.] |
| Pubbl/distr/stampa | New York, : Wiley, 2002 |
| Descrizione fisica | 1 online resource (568 p.) |
| Disciplina |
620.0015197
620/.001/5197 |
| Altri autori (Persone) | CastilloEnrique <1946-> |
| Collana | Pure and applied mathematics |
| Soggetto topico |
Programming (Mathematics)
Engineering models |
| ISBN |
1-283-33192-6
9786613331922 0-471-22529-0 0-471-46165-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Building and Solving Mathematical Programming Models in Engineering and Science; Contents; Preface; I Models; 1 Linear Programming; 1.1 Introduction; 1.2 The Transportation Problem; 1.3 The Production Scheduling Problem; 1.3.1 Production Scheduling Problem 1; 1.4 The Diet Problem; 1.5 The Network Flow Problem; 1.6 The Portfolio Problem; 1.7 Scaffolding System; 1.8 Electric Power Economic Dispatch; Exercises; 2 Mixed-Integer Linear Programming; 2.1 Introduction; 2.2 The 0-1 Knapsack Problem; 2.3 Identifying Relevant Symptoms; 2.4 The Academy Problem; 2.5 School Timetable Problem
2.6 Models of Discrete Location2.7 Unit Commitment of Thermal Power Units; Exercises; 3 Nonlinear Programming; 3.1 Introduction; 3.2 Some Geometrically Motivated Examples; 3.2.1 The Postal Package Example; 3.2.2 The Tent Example; 3.2.3 The Lightbulb Example; 3.2.4 The Surface Example; 3.2.5 The Moving Sand Example; 3.3 Some Mechanically Motivated Examples; 3.3.1 The Cantilever Beam Example; 3.3.2 The Two-Bar Truss Example; 3.3.3 The Column Example; 3.3.4 Scaffolding System; 3.4 Some Electrically Motivated Examples; 3.4.1 Power Circuit State Estimation; 3.4.2 Optimal Power Flow 3.5 The Matrix Balancing Problem3.6 The Traffic Assignment Problem; Exercises; II Methods; 4 An Introduction to Linear Programming; 4.1 Introduction; 4.2 Problem Statement and Basic Definitions; 4.3 Linear Programming Problem in Standard Form; 4.3.1 Transformation to Standard Form; 4.4 Basic Solutions; 4.5 Sensitivities; 4.6 Duality; 4.6.1 Obtaining the Dual from a Primal in Standard Form; 4.6.2 Obtaining the Dual Problem; 4.6.3 Duality Theorems; Exercises; 5 Understanding the Set of All Feasible Solutions; 5.1 Introduction and Motivation; 5.2 Convex Sets; 5.3 Linear Spaces 5.4 Polyhedral Convex Cones5.5 Polytopes; 5.6 Polyhedra; 5.6.1 General Representation of Polyhedra; 5.7 Bounded and Unbounded LPP; Exercises; 6 Solving the Linear Programming Problem; 6.1 Introduction; 6.2 The Simplex Method; 6.2.1 Motivating Example; 6.2.2 General Description; 6.2.3 Initialization Stage; 6.2.4 Elemental Pivoting Operation; 6.2.5 Identifying an Optimal Solution; 6.2.6 Regulating Iteration; 6.2.7 Detecting Unboundedness; 6.2.8 Detecting Infeasibility; 6.2.9 Standard Iterations Stage; 6.2.10 The Revised Simplex Algorithm; 6.2.11 Some Illustrative Examples 6.3 The Exterior Point Method6.3.1 Initial Stage; 6.3.2 Regulating Stage; 6.3.3 Detecting Infeasibility and Unboundedness; 6.3.4 Standard Iterations Stage; 6.3.5 The EPM Algorithm; 6.3.6 Some Illustrative Examples; Exercises; 7 Mixed-Integer Linear Programming; 7.1 Introduction; 7.2 The Branch-Bound Method; 7.2.1 Introduction; 7.2.2 The BB Algorithm for MILPP; 7.2.3 Branching and Processing Strategies; 7.2.4 Other Mixed-Integer Linear Programming Problems; 7.3 The Gomory Cuts Method; 7.3.1 Introduction; 7.3.2 Cut Generation; 7.3.3 The Gomory Cuts Algorithm for an ILPP; Exercises 8 Optimality and Duality in Nonlinear Programming |
| Record Nr. | UNINA-9910830812603321 |
| New York, : Wiley, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Orthogonal sets and polar methods in linear algebra [[electronic resource] ] : applications to matrix calculations, systems of equations, inequalities, and linear programming / / Enrique Castillo ... [et al.]
| Orthogonal sets and polar methods in linear algebra [[electronic resource] ] : applications to matrix calculations, systems of equations, inequalities, and linear programming / / Enrique Castillo ... [et al.] |
| Pubbl/distr/stampa | New York, : Wiley, c1999 |
| Descrizione fisica | 1 online resource (440 p.) |
| Disciplina | 512.5 |
| Altri autori (Persone) | CastilloEnrique <1946-> |
| Collana | Pure and applied mathematics |
| Soggetto topico |
Algebras, Linear
Orthogonalization methods |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-30623-9
9786613306234 1-118-03289-6 1-118-03114-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Orthogonal Sets and Polar Methods in Linear Algebra: Applications to Matrix Calculations, Systems of Equations, Inequalities, and Linear Programming; Contents; Part I Linear Spaces and Systems of Equations; 1 Basic Concepts; 1.1 Introduction; 1.2 Linear space; 1.3 The Euclidean Space En; 1.4 Orthogonal Sets and Decompositions; 1.5 Matrices; 1.6 Systems of Linear Equations; Exercises; 2 Orthogonal Sets; 2.1 Introduction and Motivation; 2.2 Orthogonal Decompositions; 2.3 The Orthogonalization Module; 2.4 Mathematica Program; Exercises; 3 Matrix Calculations Using Orthogonal Sets
3.1 Introduction3.2 Inverting a Matrix; 3.3 The Rank of a Matrix; 3.4 Calculating the Determinant of a Matrix; 3.5 Algorithm for Matrix Calculations; 3.6 Complexity; 3.7 Inverses and Determinants of Row-Modified Matrices; 3.8 Inverses of Symbolic Matrices; 3.9 Extensions to Partitioned Matrices; 3.10 Inverses of Modified Matrices; 3.11 Mathematica Programs; Exercises; 4 More Applications of Orthogonal Sets; 4.1 Intersection of Two Linear Subspaces; 4.2 Reciprocals Images in Linear Transformations; 4.3 Other Applications; 4.4 Mathematica Programs; Exercises 5 Orthogonal Sets and Systems of Linear Equations5.1 Introduction; 5.2 Compatibility of a System of Linear Equations; 5.3 Solving a System of Linear Equations; 5.4 Complexity; 5.5 Checking Systems Equivalence; 5.6 Solving a System in Some Selected Variables; 5.7 Modifying Systems of Equations; 5.8 Applications; 5.9 Mathematica Programs; Exercises; Appendix: Proof of Lemma 5.2; Part II Cones and Systems of Inequalities; 6 Polyhedral Convex Cones; 6.1 Introduction; 6.2 Convex Sets; 6.3 Types of Linear Combinations; 6.4 Polyhedral Convex Cones; 6.5 The Г -Process; 6.6 The Complete Г-Algorithm 6.7 Mathematica ProgramExercises; 7 Polytopes and Polyhedra; 7.1 Introduction; 7.2 Polytopes; 7.3 Polyhedra; Exercises; 8 Cones and Systems of Inequalities; 8.1 Introduction; 8.2 A Discussion of Linear Systems; 8.3 Solving Linear Systems; 8.4 Applications to Linear Programming; Exercises; Part III Linear Programming; 9 An Introduction to Linear Programming; 9.1 Introduction; 9.2 Problem Statement and Basic Definitions; 9.3 Linear Programming Problem in Standard Form; 9.4 Basic Solutions; 9.5 Duality; Exercises; 10 The Exterior Point Method; 10.1 Introduction; 10.2 The Exterior Point Method 10.3 Making the EPM More Efficient10.4 Complexity; 10.5 Recovering the Final Tableau from the Solution; 10.6 Modifying a Linear Programming Problem; Exercises; Part IV Applications; 11 Applications; 11.1 Introduction; 11.2 Matrix Analysis of Engineering Structures; 11.3 The Transportation Problem; 11.4 Production-Scheduling Problems; 11.5 The Input-Output Tables; 11.6 The Diet Problem; 11.7 Network Flow Problems; Exercises; Part V Appendices; Appendix A: A Java Application; A.l How to Use the Program; Appendix B: List of Notation; References; Index |
| Record Nr. | UNINA-9910139571003321 |
| New York, : Wiley, c1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Orthogonal sets and polar methods in linear algebra [[electronic resource] ] : applications to matrix calculations, systems of equations, inequalities, and linear programming / / Enrique Castillo ... [et al.]
| Orthogonal sets and polar methods in linear algebra [[electronic resource] ] : applications to matrix calculations, systems of equations, inequalities, and linear programming / / Enrique Castillo ... [et al.] |
| Pubbl/distr/stampa | New York, : Wiley, c1999 |
| Descrizione fisica | 1 online resource (440 p.) |
| Disciplina | 512.5 |
| Altri autori (Persone) | CastilloEnrique <1946-> |
| Collana | Pure and applied mathematics |
| Soggetto topico |
Algebras, Linear
Orthogonalization methods |
| ISBN |
1-283-30623-9
9786613306234 1-118-03289-6 1-118-03114-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Orthogonal Sets and Polar Methods in Linear Algebra: Applications to Matrix Calculations, Systems of Equations, Inequalities, and Linear Programming; Contents; Part I Linear Spaces and Systems of Equations; 1 Basic Concepts; 1.1 Introduction; 1.2 Linear space; 1.3 The Euclidean Space En; 1.4 Orthogonal Sets and Decompositions; 1.5 Matrices; 1.6 Systems of Linear Equations; Exercises; 2 Orthogonal Sets; 2.1 Introduction and Motivation; 2.2 Orthogonal Decompositions; 2.3 The Orthogonalization Module; 2.4 Mathematica Program; Exercises; 3 Matrix Calculations Using Orthogonal Sets
3.1 Introduction3.2 Inverting a Matrix; 3.3 The Rank of a Matrix; 3.4 Calculating the Determinant of a Matrix; 3.5 Algorithm for Matrix Calculations; 3.6 Complexity; 3.7 Inverses and Determinants of Row-Modified Matrices; 3.8 Inverses of Symbolic Matrices; 3.9 Extensions to Partitioned Matrices; 3.10 Inverses of Modified Matrices; 3.11 Mathematica Programs; Exercises; 4 More Applications of Orthogonal Sets; 4.1 Intersection of Two Linear Subspaces; 4.2 Reciprocals Images in Linear Transformations; 4.3 Other Applications; 4.4 Mathematica Programs; Exercises 5 Orthogonal Sets and Systems of Linear Equations5.1 Introduction; 5.2 Compatibility of a System of Linear Equations; 5.3 Solving a System of Linear Equations; 5.4 Complexity; 5.5 Checking Systems Equivalence; 5.6 Solving a System in Some Selected Variables; 5.7 Modifying Systems of Equations; 5.8 Applications; 5.9 Mathematica Programs; Exercises; Appendix: Proof of Lemma 5.2; Part II Cones and Systems of Inequalities; 6 Polyhedral Convex Cones; 6.1 Introduction; 6.2 Convex Sets; 6.3 Types of Linear Combinations; 6.4 Polyhedral Convex Cones; 6.5 The Г -Process; 6.6 The Complete Г-Algorithm 6.7 Mathematica ProgramExercises; 7 Polytopes and Polyhedra; 7.1 Introduction; 7.2 Polytopes; 7.3 Polyhedra; Exercises; 8 Cones and Systems of Inequalities; 8.1 Introduction; 8.2 A Discussion of Linear Systems; 8.3 Solving Linear Systems; 8.4 Applications to Linear Programming; Exercises; Part III Linear Programming; 9 An Introduction to Linear Programming; 9.1 Introduction; 9.2 Problem Statement and Basic Definitions; 9.3 Linear Programming Problem in Standard Form; 9.4 Basic Solutions; 9.5 Duality; Exercises; 10 The Exterior Point Method; 10.1 Introduction; 10.2 The Exterior Point Method 10.3 Making the EPM More Efficient10.4 Complexity; 10.5 Recovering the Final Tableau from the Solution; 10.6 Modifying a Linear Programming Problem; Exercises; Part IV Applications; 11 Applications; 11.1 Introduction; 11.2 Matrix Analysis of Engineering Structures; 11.3 The Transportation Problem; 11.4 Production-Scheduling Problems; 11.5 The Input-Output Tables; 11.6 The Diet Problem; 11.7 Network Flow Problems; Exercises; Part V Appendices; Appendix A: A Java Application; A.l How to Use the Program; Appendix B: List of Notation; References; Index |
| Record Nr. | UNINA-9910829999103321 |
| New York, : Wiley, c1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||