# Operations Research and Reliability-LPP Computational Methods (ISS 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 exam-pattern 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

Essay Question▾

### Describe in Detail

Solve the following problem Simplex method.

Maximize Z = 8x1+6x2

Subject to

x1+x2 ≤ 10

2x1+3x2 ≤ 25

x1+5x2 ≤ 35

x1, x2 ≥ 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 constraint-equations

• Testing whether it is an optimal solution

• Improving the first trial solution by a set of rules and repeating the process till… (539 more words) …

f Page