Formulating LPP from Word Problem | Linear Programming Problems in Operational Research | Example 1

Support Simple Snippets by Donations - Google Pay UPI ID - tanmaysakpal11@okicici PayPal - paypal.me/tanmaysakpal11 --------------------------------------------------------------------------------------------- In this video tutorial we will learn how to formuate the LPP from a given word problem. We will first make the table with the given details in the word problem. Then we will formulate the Maximization equation and lastly we will list the constraints in algebraic form. Q1) A firm manufactures 2 types of products A & B and sells them at a profit of Rs 2 on A ans Rs 3 on B. Each products is processed on 2 machines G & H. Product A requires 1 minute processing time o G & 2 minutes on H. Product B requires 1 minute on each machine. The Machine G is available for not more than 6 hours 4minutes while machine H is available for 10 hours during any working day. Formulate the Problem as an LPP? Full Operational Research Playlist - https://www.youtube.com/watch?v=-Wm2ItRS3GE&list=PLIY8eNdw5tW_UuFLy_vUP2pXNIHls2Pwd Simple Snippets Official Website - http://simplesnippets.tech/ Simple Snippets on Facebook - https://www.facebook.com/simplesnippets/ Simple Snippets on Instagram - https://www.instagram.com/simplesnippets/ Simple Snippets on Twitter - https://twitter.com/simplesnippet Simple Snippets Google Plus Page - https://plus.google.com/+SimpleSnippets Simple Snippets email ID - [email protected] For More Technology News, Latest Updates and Blog articles visit our Official Website - http://simplesnippets.tech/ #LinearProgrammingProblem #LPP #GraphicalSolution #OperationsResearch