The Gateway to Computer Science Excellence
+1 vote
203 views

Consider an LPP given as

$\text{Max } Z=2x_1-x_2+2x_3$

subject to the constraints

$$2x_1+x_2 \leq 10 \\ x_1+2x_2-2x_3 \leq 20 \\ x_1 + 2x_3 \leq 5 \\ x_1, \: x_2 \: x_3 \geq 0 $$ What shall be the solution of the LLP after applying first iteration of the Simplex Method?

  1. $x_1 = \frac{5}{2},\: x_2=0, \: x_3=0, \: Z=5$
  2. $x_1 = 0, x_2=0, \: x_3=\frac{5}{2}, \: Z=5$
  3. $x_1 = 0, x_2=\frac{5}{2}, \: x_3=0, \: Z=-\frac{5}{2}$
  4. $x_1 = 0, x_2=0, \: x_3=10, \: Z=20$
in Numerical Methods by Veteran (425k points)
edited by | 203 views

1 Answer

0 votes
Option B

x1=0, x2=0, x3=5/2, z=5
by (193 points)
0
Please explain ma'am
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,556 answers
195,716 comments
101,582 users