rent-now

Rent More, Save More! Use code: ECRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

9780387766348

Introduction to Applied Optimization

by Diwekar, Urmila
  • ISBN13:

    9780387766348

  • ISBN10:

    0387766340

  • eBook ISBN(s):

    9780387766355

  • Edition: 2nd
  • Format: Hardcover
  • Copyright: 2008-11-01
  • Publisher: Springer Nature
  • Purchase Benefits
  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $99.99 Save up to $67.59
  • Digital
    $70.20*
    Add to Cart

    DURATION
    PRICE
    *To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.

Summary

"This text presents a multi-disciplined view of optimization, providing students and researchers with a thorough examination of algorithms, methods, and tools from diverse areas of optimization without introducing excessive theoretical detail. This second edition includes additional topics, including global optimization and a real-world case study using important concepts from each chapter." "Introduction to Applied Optimization is intended for advanced undergraduate and graduate students and will benefit scientists from diverse areas, including engineers."--BOOK JACKET.

Table of Contents

Forewordp. xi
Preface to the Second Editionp. xv
Acknowledgmentsp. xvii
List of Figuresp. xix
List of Tablesp. xxiii
Introductionp. 1
Problem Formulation: A Cautionary Notep. 3
Degrees of Freedom Analysisp. 3
Objective Function, Constraints, and Feasible Regionp. 4
Numerical Optimizationp. 5
Types of Optimization Problemsp. 7
Summaryp. 7
Bibliographyp. 8
Exercisesp. 9
Linear Programmingp. 11
The Simplex Methodp. 12
Infeasible Solutionp. 17
Unbounded Solutionp. 19
Multiple Solutionsp. 21
Sensitivity Analysisp. 23
Other Methodsp. 26
Hazardous Waste Blending Problem as an LPp. 28
Summaryp. 34
Bibliographyp. 34
Exercisesp. 35
Nonlinear Programmingp. 41
Convex and Concave Functionsp. 44
Unconstrained NLPp. 47
Necessary and Sufficient Conditions and Constrained NLPp. 52
Constraint Qualificationp. 62
Sensitivity Analysisp. 62
Numerical Methodsp. 64
Global Optimization and Interval Newton Methodp. 68
Hazardous Waste Blending: An NLPp. 69
Summaryp. 71
Bibliographyp. 72
Exercisesp. 72
Discrete Optimizationp. 77
Tree and Network Representationp. 78
Branch-and-Bound for IPp. 80
Numerical Methods for IP, MILP, and MINLPp. 84
Probabilistic Methodsp. 99
Hazardous Waste Blending: A Combinatorial Problemp. 107
The OA-based MINLP Approachp. 109
The Two-Stage Approach with SA-NLPp. 109
A Branch-and-Bound Procedurep. 112
Summaryp. 116
Bibliographyp. 116
Exercisesp. 118
Optimization Under Uncertaintyp. 125
Types of Problems and Generalized Representationp. 131
Chance Constrained Programming Methodp. 139
L-shaped Decomposition Methodp. 142
Uncertainty Analysis and Samplingp. 146
Specifying Uncertainty Using Probability Distributionsp. 147
Sampling Techniques in Stochastic Modelingp. 148
Sampling Accuracy and the Decomposition Methodsp. 156
Implications of Sample Size in Stochastic Modelingp. 156
Stochastic Annealingp. 157
Hazardous Waste Blending Under Uncertaintyp. 164
The Stochastic Optimization Problemp. 168
Results and Discussionp. 170
Summaryp. 172
Bibliographyp. 172
Exercisesp. 175
Multiobjective Optimizationp. 179
Nondominated Setp. 183
Solution Methodsp. 186
Weighting Methodp. 189
Constraint Methodp. 194
Goal Programming Methodp. 197
Hazardous Waste Blending and Value of Researchp. 199
Variance as an Attribute: The Analysis of Uncertaintyp. 200
Base Objective: Minimization of Frit Massp. 200
Robustness: Minimizing Variancep. 201
Reducing Uncertainty: Minimizing the Time Devoted to Researchp. 203
Discussion: The Implications of Uncertaintyp. 204
Summaryp. 208
Bibliographyp. 208
Exercisesp. 212
Optimal Control And Dynamic Optimizationp. 215
Calculus of Variationsp. 219
Maximum Principlep. 224
Dynamic Programmingp. 227
Stochastic Processes and Dynamic Programmingp. 231
Ito's Lemmap. 235
Dynamic Programming Optimality Conditionsp. 236
Reversal of Blending: Optimizing a Separation Processp. 240
Calculus of Variations Formulationp. 247
Maximum Principle Formulationp. 248
Method of Steepest Ascent of Hamiltonianp. 250
Combining Maximum Principle and NLP Techniquesp. 251
Uncertainties in Batch Distillationp. 253
Relative Volatility: An Ito Processp. 254
Optimal Reflux Profile: Deterministic Casep. 257
Case in Which Uncertainties Are Presentp. 258
State Variable and Relative Volatility: The Two Ito Processesp. 260
Coupled Maximum Principle and NLP Approach for the Uncertain Casep. 262
Summaryp. 265
Bibliographyp. 265
Exercisesp. 266
Appendixp. 279
Indexp. 283
Table of Contents provided by Ingram. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program