Operations Research: Applications and Algorithms, Τόμος 1

arrival assume average basic feasible solution basic variables basis remains optimal beginning choose concave function constraint convex convex function current basis remains customers demand determine distribution dollars dual dynamic programming Erlang distribution example expected reward exponential exponentially distributed feasible region Figure following LP goal holding cost increase incurred integer interarrival inventory investment knapsack problem LINDO linear programming LP relaxation machine Markov chain matrix max problem maximize maximum method minimize month node non-negative nonbasic variable objective function obtain optimal solution optimal tableau P₁ percent period Powerco primal probability production profit purchase queuing system random number random variable reorder point requires revenue right-hand side row player s₁ s₂ satisfy Section shadow price shortest path shown in Table simplex algorithm simulation solve subproblem Suppose Theorem units vector x₁ x₂ y₁ yields z-value zero