What people are saying - Write a review
We haven't found any reviews in the usual places.
The Dual Problem and Postoptimality Analysis
The Transportation Problem and Network Models
17 other sections not shown
Other editions - View all
activities algorithm applying arcs arrival assumed basic feasible solution basic solution basic variables Chapter coefficients column computations convex convex combination convex set corresponding cost defined demand determine distribution dual problem dynamic programming elements entering variable equal to zero Example exponential distribution extreme point feasibility condition formulation given hence illustrated indicated infeasible integer inventory iteration leaving variable linear programming problem Markov chain matrix maximin maximize x0 maximum means minimax minimize x0 node nonbasic variables nonnegative Notice number of units objective function obtained optimal solution optimality condition optimum parameters period player Poisson Poisson distribution procedure production programming model pure strategies queue queueing models queueing theory random variable recursive equation represent result saddle point satisfied Section selected servers simplex method simplex multipliers slack variables solution space Solve stage starting solution Table technique theorem transportation model yields z-transform