The Gateway to Computer Science Excellence
+1 vote
1.3k views
69. Consider the following LPP :

Min Z=2x1+x2+3x3 Subject to :

x1−2x2+x3 / 4 2x1+x2+x3 £ 8 x1−x3 / 0 x1 , x2 , x3 / 0

The solution of this LPP using Dual Simplex Method is :

(1) x1=0, x2=0, x3=3 and Z=9

(2) x1=0, x2=6, x3=0 and Z=6

(3) x1=4, x2=0, x3=0 and Z=8

(4) x1=2, xx2=0, x3=2 andZ=10
in Numerical Methods by (399 points) | 1.3k views

1 Answer

+1 vote

Ans. is C : x1=4, x2=0, x3=0 and Z=8

by (191 points)
0
How to solve such a big LPP in 2 min ?

Related questions

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,601 answers
195,852 comments
102,219 users