This course introduces students to the fundamental concepts and techniques of mathematical programming. It covers linear programming models, including formulation, the simplex method, and duality. Students will learn to solve optimization problems using graphical and algebraic methods, sensitivity analysis, and integer programming. The course also explores transportation problems and two-person zero-sum games, providing a comprehensive understanding of mathematical programming applications in various fields.
Transform this course into personalized study materials with AI
Everything you need to know about this course
Key areas covered in this course
No specific requirements needed
This course is designed to be accessible to all students. You can start immediately without any prior knowledge or specific preparation.
How your progress will be evaluated (3 methods)
Comprehensive evaluation of course material understanding
Comprehensive evaluation of course material understanding
Comprehensive evaluation of course material understanding
Explore the career paths this course opens up for you
Apply your skills in this growing field
Apply your skills in this growing field
Apply your skills in this growing field
Apply your skills in this growing field
Apply your skills in this growing field
Real-world sectors where you can apply your knowledge
A structured 13-week journey through the course content
This study schedule is in beta and may not be accurate. Please use it as a guide and consult the course outline for the most accurate information.
Expert tips to help you succeed in this course
Thoroughly review all worked examples in the study units, focusing on the step-by-step application of each method.
Practice formulating linear programming models from diverse scenarios, paying close attention to defining decision variables, objective functions, and constraints.
Create concept maps linking the simplex method, duality, and sensitivity analysis to understand their interrelationships.
Focus on mastering the simplex method, including initialization, iteration, and termination conditions.
Practice solving transportation problems using different methods (NWCR, Least Cost, VAM) and optimizing with the MODI method.
Review the assumptions and limitations of linear programming and integer programming.
Pay special attention to the economic interpretation of dual variables and shadow prices.
Work through all Tutor-Marked Assignments (TMAs) and self-assessment exercises to reinforce understanding and identify areas for improvement.
Other courses in Sciences that complement your learning