OPER 213_ البرمجة الخطية

Definitions and formulation of linear programs. Review of linear algebra and convex analysis. Algebra of the simplex method. The simplex method. Sensitivity analysis. Duality theory. The dual simplex method. The revised simplex method. Some applications of linear programming.
 

Topics to be Covered
List of Topics	No. of Weeks	Contact hours
Introduction about LP –  Definitions and Assumptions.	1	5
Formulating LP Problems – Examples from Different Applications.	2.5	12.5
LP Standard Form – Conversion LP Problems into Standard Form.	0.5	2.5
Mathematical Properties Of LP Problems – Basic Solutions.	1	5
The Tableau Simplex Method – Explaining the Geometry and Algebra of the Simplex Method.	2	10
Special Cases in Applying the Simplex Method: The Big M Method – The Two-Phase Method	1.5	7.5
Sensitivity Analysis.	1.5	7.5
Duality.	1.5	7.5
The Dual Simplex Method.	1.5	7.5
The Revised Simplex Method.	1	5
Special LP Applications: Transportation Problems – Assignment Problems – Networks Problems.	1	5