Operations Research Applications and Algorithms

ISBN-10: 0534209718
ISBN-13: 9780534209711
Edition: 3rd 1998
Authors: Wayne L. Winston
List price: $87.95
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Business Ethics Online content $4.95 $1.99
Add to cart
Study Briefs
Business Law Online content $4.95 $1.99
Add to cart
Study Briefs
Management Online content $4.95 $1.99

Customers also bought


Book details

List price: $87.95
Edition: 3rd
Copyright year: 1998
Publisher: Wadsworth
Binding: Mixed Media
Pages: 1318
Weight: 6.050
Language: English

Wayne L. Winston is a professor of Decision Sciences at Indiana University's Kelley School of Business and has earned numerous MBA teaching awards. For 20+ years, he has taught clients at Fortune 500 companies how to use Excel to make smarter business decisions. Wayne and his business partner Jeff Sagarin developed the player-statistics tracking and rating system used by the Dallas Mavericks professional basketball team. He is also a two time Jeopardy! champion.

Introduction to model building
An Introduction to Modeling
The Seven-Step Model-Building Process
Basic linear algebra
Matrices and Vectors
Matrices and Systems of Linear Equations
The Gauss-Jordan Method for Solving Systems of Linear Equations
Linear Independence and Linear Dependence
The Inverse of a Matrix
Introduction to linear programming
What is a Linear Programming Problem? The Graphical Solution of Two-Variable Linear Programming Problems
Special Cases
A Diet Problem
A Work-Scheduling Problem
A Capital Budgeting Problem
Short-term Financial Planning
Blending Problems
Production Process Models
Using Linear Programming to Solve Multiperiod Decision Problems: An Inventory Model
Multiperiod Financial Models
Multiperiod Work Scheduling
The simplex algorithm and goal programming
How to Convert an LP to Standard Form
Preview of the Simplex Algorithm
The Simplex Algorithm
Using the Simplex Algorithm to Solve Minimization Problems
Alternative Optimal Solutions
Unbounded LPs
The LINDO Computer Package
Matrix Generators, LINGO, and Scaling of LPs
Degeneracy and the Convergence of the Simplex Algorithm
The Big M Method
The Two-Phase Simplex Method
Unrestricted-in-Sign Variables
Karmarkar''s Method for Solving LPs
Multiattribute Decision-Making in the Absence of Uncertainty: Goal Programming
Solving LPs with Spreadsheets
Sensitivity analysis: an applied approach
A Graphical Introduction to Sensitivity Analysis
The Computer and Sensitivity Analysis
Managerial Use of Shadow Prices
What Happens to the Optimal z-value if the Current Basis is No Longer Optimal?
Sensitivity analysis and duality
A Graphical Introduction to Sensitivity Analysis
Some Important Formulas
Sensitivity Analysis
Sensitivity Analysis When More Than One Parameter is Changed: The 100% Rule
Finding the Dual of an LP
Economic Interpretation of the Dual Problem
The Dual Theorem and Its Consequences
Shadow Prices
Duality and Sensitivity Analysis
Transportation, assignment, and transshipment problems
Formulating Transportation Problems
Finding Basic Feasible Solutions for Transportation Problems
The Transportation Simplex Method
Sensitivity Analysis for Transportation Problems
Assignment Problems
Transshipment Problems
Network models
Basic Definitions
Shortest Path Problems
Maximum Flow Problems
Minimum Cost Network Flow Problems
Minimum Spanning Tree Problems
The Network Simplex Method
Integer programming
Introduction to Integer Programming
Formulation Integer Programming Problems
The Branch-and-Bound Method for Solving Pure Integer Programming Problems
The Branch-and-Bound Method for Solving Mixed Integer Programming Problems
Solving Knapsack Problems by the Branch-and-Bound Method
Solving Combinatorial Optimization Problems by the Branch-and-Bound Method
Implicit Enumeration
The Cutting Plane Algorithm
Advanced topics in linear programming
The Revised Simplex Algorithm
The Product Form of the Inverse
Using Column Generation to Solve Large-Scale LPs
The Dantzig-Wolfe Decomposition Algorithm
The Simplex Methods for Upper-Bounded Variables
Karmarkar''s Method for Solving LPs
Nonlinear programming
Review of Differential Calculus
Introductory Concepts
Convex and Concave Functions
Solving NLPs with One Variable
Golden Section Search
Unconstrained Maximization and Minimization with Several Variables
The Method of Steepest Ascent
Lagrange Multiples
The Kuhn-Tucker Conditions
Quadratic Programming
Separable Programming
The Method of Feasible Directions
Pareto Optimality and Tradeoff Curves
Review of calculus and probability
Review of Integral Calculus
Differentiation of Integrals
Basic Rules of Probability
Bayes'' Rule
Random Variables
Mean Variance and Covariance
The Normal Distribution
Review Problems
Decision making under uncertainty
Decision Criteria
Utility Theory
Flaws in Expe

Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.