Operations Research and ReliabilityLPP Computational Methods (ISS (Statistical Services) Statistics Paper IV): Questions 1  1 of 1
Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 79 questions. Access all new questions we will add tracking exampattern and syllabus changes. View Sample Explanation or View Features.
Rs. 300.00 or
Question number: 1
» Operations Research and Reliability » LPP Computational Methods
Appeared in Year: 2015
Describe in Detail
Solve the following problem Simplex method.
Maximize Z = 8x_{1}+6x_{2}
Subject to
x_{1}+x_{2 } ≤ 10
2x_{1}+3x_{2} ≤ 25
x_{1}+5x_{2} ≤ 35
x_{1}, x_{2} ≥ 0
Explanation
The Simplex algorithm is an iterative procedure for solving LP problems in a finite number of steps. It consists of

Having a trial basic feasible solution to constraintequations

Testing whether it is an optimal solution

Improving the first trial solution by a set of rules and repeating the process till