About this Module
What you will learn
This course introduces students to a variety of operations research techniques in decision-making. It emphasizes the formulation of problems and the interpretation of solutions Linear programming (LP) is a powerful optimization technique that is widely used in operations research to find the best solution to a problem subject to certain constraints. It is a mathematical technique that can help you to maximize or minimize a linear objective function while ensuring that a set of linear constraints is satisfied. In simple terms, it is a method of allocating limited resources among different activities in a way that optimizes a certain objective. The goal of the LP problem is to find the values of the decision variables that maximize (or minimize) the objective function while satisfying all the constraints. Linear programming problems can be solved using a variety of methods, including the graphical method, simplex method, and interior point methods. The graphical method is suitable for problems with two decision variables, while the simplex method is used for more complex problems with multiple decision variables.
What skills you will gain
Not applicable
Total contents and assessments
Not applicable
Module Details
CLUSTER : Science & Technology ( ST ) MODE/DURATION : Flexible LENGTH : 2 days EFFORT : 4 LEVEL : Beginner LANGUAGE : English CERTIFICATE : Not applicable CPD POINT : 0 PRICE : Free Associated Course (s) : No Course
