DynamicPaper DP Archives Coverageforall Form

Instructions and help about DynamicPaper DP Archives Coverageforall

very good morning today i will explain important question please solve the following lpp by dynamic programming approach and the question is maximize z is equal to 8 x 1 plus 7 x 2 subject to the conditions 2 x 1 plus x 2 less than or equal to 8 5 x 1 plus 2 x 2 less than or equal to 15 if you see this question we have two decision variables in this given example so this problem is said to be in the given question in the given problem we have we have two decision variables two decision variables x one comma x two x one comma come x2 and 2 constraints two constraints so so it is it is a two state and two stage problem two state and two stage problem and this means in this question we are going to do two stages do you remember in the production allocation when we were having three variables x1 x2 x3 we have solved the question with three stages called stage three stage two stage one similarly in this example we have x one comma x two as two variables so we will solve x one comma x two in