Operations Research : Applications and Algorithms - 4th Edition - by Wayne L. Winston - ISBN 9780534380588

Operations Research : Applications and ...
4th Edition
Wayne L. Winston
Publisher: Brooks Cole
ISBN: 9780534380588

Solutions for Operations Research : Applications and Algorithms

Chapter

Section

Browse All Chapters of This Textbook

Name: Operations Research : Applications and Algorithms
Author: Wayne L. Winston
ISBN: 9780534380588

Chapter 2 - Basic Linear Algebra Chapter 2.1 - Matrices And Vectors Chapter 2.2 - Matrices And Systems Of Linear Equations Chapter 2.3 - The Gauss-jordan Method For Solving Systems Of Linear Equations Chapter 2.4 - Linear Independence And Linear Dependence Chapter 2.5 - The Inverse Of A Matrix Chapter 2.6 - Determinants Chapter 3 - Introduction To Linear Programming Chapter 3.1 - What Is A Linear Programming Problem?Chapter 3.2 - The Graphical Solution Of Two-variable Linear Programming Problems

Chapter 3.3 - Special Cases Chapter 3.4 - A Diet Problem Chapter 3.5 - A Work-scheduling Problem Chapter 3.6 - A Capital Budgeting Problem Chapter 3.7 - Short-term Financial Planning‡Chapter 3.8 - Blending Problems Chapter 3.9 - Production Process Models Chapter 3.10 - Using Linear Programming To Solve Multiperiod Decision Problems: An Inventory Model Chapter 3.11 - Multiperiod Financial Models Chapter 3.12 - Multiperiod Work Scheduling Chapter 4 - The Simplex Algorithm And Goal Programming Chapter 4.1 - How To Convert An Lp To Standard Form Chapter 4.4 - Why Does An Lp Have An Optimal Bfs?Chapter 4.5 - The Simplex Algorithm Chapter 4.6 - Using The Simplex Algorithm To Solve Minimization Problems Chapter 4.7 - Alternative Optimal Solutions Chapter 4.8 - Unbounded Lps Chapter 4.10 - Matrix Generators, Lingo, And Scaling Of Lps Chapter 4.11 - Degeneracy And The Convergence Of The Simplex Algorithm Chapter 4.12 - The Big M Method Chapter 4.13 - The Two-phase Simplex Method Chapter 4.14 - Unrestricted-in-sign Variables Chapter 4.16 - Multiattribute Decision Making In The Absence Of Uncertainty: Goal Programming Chapter 4.17 - Using The Excel Solver To Solve Lps Chapter 5 - Sensitivity Analysis: An Applied Approach Chapter 5.1 - A Graphical Introduction To Sensitivity Analysis Chapter 5.2 - The Computer And Sensitivity Analysis Chapter 5.3 - Managerial Use Of Shadow Prices Chapter 6 - Sensitivity Analysis And Duality Chapter 6.1 - A Graphical Introduction To Sensitivity Analysis Chapter 6.2 - Some Important Formulas Chapter 6.3 - Sensitivity Analysis Chapter 6.4 - Sensitivity Analysis When More Than One Parameter Is Changed: The 100% Rule Chapter 6.5 - Finding The Dual Of An Lp Chapter 6.6 - Economic Interpretation Of The Dual Problem Chapter 6.7 - The Dual Theorem And Its Consequences Chapter 6.8 - Shadow Prices Chapter 6.9 - Duality And Sensitivity Analysis Chapter 6.10 - Complementary Slackness Chapter 6.11 - The Dual Simplex Method Chapter 6.12 - Data Envelopment Analysis Chapter 7 - Transportation, Assignment, And Transshipment Problems Chapter 7.1 - Formulating Transportation Problems Chapter 7.2 - Finding Basic Feasible Solutions For Transportation Problems Chapter 7.3 - The Transportation Simplex Method Chapter 7.5 - Assignment Problems Chapter 8 - Network Models Chapter 8.2 - Shortest-path Problems Chapter 8.4 - Cpm And Pert Chapter 9 - Integer Programming Chapter 9.2 - Formulating Integer Programming Problems Chapter 9.6 - Solving Combinatorial Optimization Problems By The Branch-and-bound Method Chapter 10.4 - The Dantzig-wolfe Decomposition Algorithm Chapter 11 - Nonlinear Programming Chapter 11.2 - Introductory Concepts Chapter 13.2 - Utility Theory Chapter 13.3 - Flaws In Expected Maximization Of Utility: Prospect Theory And Framing Effects Chapter 13.5 - Bayes’ Rule And Decision Trees Chapter 14.4 - Two-person Nonconstant-sum Games Chapter 16.8 - (r, S) Periodic Review Policy Chapter 17 - Markov Chains Chapter 17.2 - What Is A Markov Chain?Chapter 17.6 - Absorbing Chains Chapter 18 - Deterministic Dynamic Programming Chapter 19.3 - How To Maximize The Probability Of A Favorable Event Occurring Chapter 19.4 - Further Examples Of Probabilistic Dynamic Programming Formulations Chapter 20.6 - The M/m/s/gd/∞/∞ Queuing System Chapter 20.9 - Finite Source Models: The Machine Repair Model Chapter 20.10 - Exponential Queues In Series And Open Queuing Networks Chapter 23 - Simulation With The Excel Add-in @risk

Book Details

The market-leading textbook for the course, Winston's OPERATIONS RESEARCH owes much of its success to its practical orientation and consistent emphasis on model formulation and model building. It moves beyond a mere study of algorithms without sacrificing the rigor that faculty desire. As in every edition, Winston reinforces the book's successful features and coverage with the most recent developments in the field. The Student Suite CD-ROM, which now accompanies every new copy of the text, contains the latest versions of commercial software for optimization, simulation, and decision analysis.

Benefits:

NEW!-This edition places greater emphasis on spreadsheets, with more examples and instructions appearing throughout the text.
NEW!-The Student Suite CD-ROM that accompanies every new copy of the text contains the latest versions of commercial software, including LINDO, LINGO, Premium Solver, NeuralWorks Predict, DecisionTools Suite (@RISK, PrecisionTree, and BestFit), StatPro, and ProcessModel.
NEW!-Over 200 new exercises have been added, and hundreds have been revised.
NEW!-The text now includes output and instructions for using ProcessModel and @Risk, two popular professional simulation software packages.
NEW!-Many new examples are taken from hot emerging disciplines such as financial engineering.
The book's emphasis on model formulation and model building throughout reinforces the practical approach taken by this text.
The rich and thorough examples and exercises offer excellent applications to industry.