Linear and integer programming: theory and practice, Volume 1
Dekker, Apr 19, 1996 - Business & Economics - 673 pages
This unique reference/text details the theoretical and practical aspects of linear and integer programming - covering a wide range of subjects, including duality, optimality criteria, sensitivity analysis, and numerous solution techniques for linear programming problems.
Requiring only an elementary knowledge of set theory, trigonometry, and calculus, Linear and Integer Programming reflects both the problem-analyzing and problem-solving abilities of linear and integer programming...presents the more rigorous mathematical material in such a way that it can be easily skipped without disturbing the readability of the text...contains important pedagogical features such as a user-friendly, IBM-compatible computer software package for solving linear-programming problems, numerous case studies, fully worked examples, helpful end-of-chapter exercises, the answers to selected problems, key literature citations, and over 1375 equations, drawings, and tables...and more.
Linear and Integer programming is a fundamental reference for applied mathematicians, operations researchers, computer scientists, economists, and industrial engineers, as well as an ideal text for upper-level undergraduate and graduate students in this disciplines.
24 pages matching shadow cost in this book
Results 1-3 of 24
What people are saying - Write a review
We haven't found any reviews in the usual places.
LINEAR PROGRAMMING DANTZIGS SIMPLEX METHOD
14 other sections not shown
Other editions - View all
basic feasible solution basic variables calculated column Computer exercise Consider constraints convex convex set corresponding crew exchanges cycle decision variables defined degenerate demand denoted determine digraph dual model dual optimal solution dual variables easily check entries equivalent feasible region formulated Gaussian elimination graph Hence hyperplanes incidence matrix infeasible Interior Path interior point Iteration Knapsack Problem Linear Programming LP-model LP-relaxation minimal Model Dovetail napkins node nonbasic variables nondegenerate nonnegativities nonsingular nonzero Note objective coefficient objective function optimal objective value optimal Simplex Tableau optimal value parameter perturbation function planning period platform primal model procedure production Proof of Theorem right-hand side satisfies schedule Section shadow cost shadow price shortage Simplex Algorithm Simplex Method slack variables solution of model solved spanning tree Step subperiod Table technology matrix Theorem tolerance interval totally unimodular Traveling Salesman Problem vector vertex vertices x e Rn zero