Linear Programming Problems
Group 1
Ananya Sharma - A016
Muskaan Kothari - A041
Priyangi Jain - A013
Siya Gupta - A001
Tanya Sabharwal - A021
Mentor
Prof. Nagapati Hegde
Index
What is a Linear Programming Problem?
(i) variables are non – negative
(ii) variables satisfy linear constraints
�
OBJECTIVES
Cost Minimisation
Components Of Linear Programming Problem
Constraints
Objective Function
Decision Variables
Common Concepts Involved In LPP Model Formulation
Assumptions
The constraints are linear.
The variables involved are continuous.
The objective function is to be optimised.
Investment Portfolio as an Application
HDFC Mutual Funds Annual Report(2020-2021)
Data Collection Methodology
The data we have collected here is Secondary data:
Data
Objective
Constraints:�
Modelling the problem as LPP
Software Used : TORA
We have chosen to use TORA for this problem since it is easy to operate and has a very user-friendly interface.
Excel’s Solver was also another viable option.
TORA Menu
Input Grid for Problem
TORA Output
Solution
Solution
The surplus and slack basic variables take values :
Surplus variables : S3 = 237.6625, S5 = 312.8628, S6 = 237.6625, S7 = 162.4622
Slack variables : S8 = 550.5253, S11 = 162.4622
The non-basic variables are : S1 = S2 = S4 = S9 = S10 = S12 = 0
(All values are in crores)
Interpretation
The maximum possible return is Rs. 2439.6398 crore on the original investment of Rs. 4753.25 crore.
This can be achieved if the company invests
Rs. 950.6500 crore in PPF, Rs. 712.9875 crore in Treasury Bills,
Rs. 950.6500 crore in Fixed Deposits, Rs. 637.7872 crore in Gold, Rs. 712.9875 crore in Bonds and Rs. 788.1878 crore in Crude Oil.
This shows that we can get a maximum return of 51.33% on our investment if we choose to invest in PPF, Treasury Bills, Fixed Deposits, Gold, Bonds and Crude Oil keeping in mind the constraints we have been given.
Interpretation
The solution is unique as there is only one investment giving this high a yield. The solution is feasible as all the constraints are satisfied.
The solution is optimum because it is the maximum possible value for this investment considering the given constraints.
It could be possible to further increase this return by changing the constraints. This is a part of sensitivity analysis.
We could also choose to invest in different securities which give higher returns as compared to the ones listed above.
Limitations
Note : Karmarkar’s Algorithm
Karmarkar’s Algorithm was introduced in 1984 for solving linear programming problems by Dr. Narendra Karmarkar (Pune) from IIT Bombay. Complex optimization problems are solved much faster using Karmarkar’s Algorithm. His algorithm thus enables faster business and policy decisions.
Bibliography
THANK YOU!