Operations research: applications and algorithms |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
BASIC LINEAR ALGEBRA | 9 |
l | 42 |
INTRODUCTION TO LINEAR PROGRAMMING | 51 |
Copyright | |
24 other sections not shown
Other editions - View all
Common terms and phrases
annual assume basic feasible solution basic variable basis remains optimal choose coefficient in row concave function constraint convex function convex set current basis remains Dakota problem decision maker decision variables decrease demand determine dual enter the basis example feasible region Figure following LP Formulate an LP Giapetto goal goal programming Golden Section Search holding cost increase integer programming investment labor LINDO output linear programming lottery LP relaxation matrix max problem maximize maximum maximum flow problem maxz method minimize minimum node nonbasic variable nonnegative objective function coefficient obtain optimal solution optimal tableau optimal z-value Powerco primal PROBLEMS GROUP profit programming problem purchased random variable reorder point requires right-hand side row player satisfy Section shadow price Shapley value Show shown in Table simplex algorithm Step subproblem Suppose Test Market Theorem utility function vector yields zero
Bibliographic information
| Title | Operations research: applications and algorithms Business Statistics Duxbury series in statistics and decision sciences |
| Author | Wayne L. Winston |
| Edition | 2 |
| Publisher | PWS-Kent Pub. Co., 1991 |
| ISBN | 0534924956, 9780534924959 |
| Length | 1262 pages |
| Subjects | › Business & Economics / General Business & Economics / Operations Research Science / System Theory |
| Export Citation | BiBTeX EndNote RefMan |