Linear Programming

06-Ankita Bhatiya
15-Divya Panpaliya
30-Mrunal Bhosale
41-Priyadarshani Wadmare
Contents

 Introduction to Linear Programming

 Objectives
 Formulation:
a. Solving by graphical method
b. Minimisation case
c. Maximisation case
d. Mixed Constraints
What is Linear Programming

 It is a mathematical modelling technique used to solve decision making

problems

 Consists of linear objectives and constraints which have proportionate

relationship
The basic components of linear
programming are as follows:
 Decision variables - These are the quantities to be determined.

 Objective function - This represents how each decision variable would

affect the cost, or, simply, the value that needs to be optimized.

 Constraints - These represent how each decision variable would use limited
amounts of resources.

 Data - These quantify the relationships between the objective function and
the constraints.
Steps in Application

 Identifying problem as solvable by linear programming

 Formulate a mathematical model of the unstructured model

 Solve the model

 Implementation