Linear Programming

Books that cover Section 11

Looking for the right book for this section? These are the titles from our M.Sc range that cover it — tap through for full contents, price and buy options.

Operations Research

M.A. & M.Sc. Mathematics, Management students · Dr. H.K. Pathak

Covers: The full section — LP models & convex sets, the simplex / two-phase / revised-simplex methods, duality, transportation problems (NW-corner, least-cost, Vogel, MODI) and the assignment problem (Hungarian method).

View details

Full syllabus — Section 11

• Linear programming models; convex sets; extreme points; basic feasible solutions; graphical & simplex methods; two-phase and revised simplex; duality (weak & strong)
• Transportation problems (balanced & unbalanced); initial basic feasible solution (least-cost, north-west corner, Vogel’s approximation); optimal solution via the modified distribution (MODI) method
• Assignment problems; Hungarian method