Use the simplex method to solve the linear programmingproblem.View an example Get more help.$4OA. The maximum iswhen X₁(Type integers or simplified fractions.)OB. There is no maximum.22R800Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice.F4%5TF5A6YF687&X2=F7U...*8▶11Maximizesubject to:withS₂ =F8•199z = 10x₁ + 10x₂and S3 =►►►x₁ ≥0, x₂ 20F98x₁ + 2x₂ ≤245X+X2 5402x₁ + 2x₂ ≤26Clear allO1F10Check ans1P4)F11

Consider the provided LPP, Max z=10x1+10x2subjected to:8x1+2x2≤245x1+x2≤402x1+2x2≤26with x1≥0, x2≥0…

Answered: Use the simplex method to solve the…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Related questions

Question

Use the simplex method to solve the linear programming
problem.
View an example Get more help.
$
4
OA. The maximum is
when X₁
(Type integers or simplified fractions.)
OB. There is no maximum.
22
R
800
Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice.
F4
%
5
T
F5
A
6
Y
F6
87
&
X2=
F7
U
...
*
8
▶11
Maximize
subject to:
with
S₂ =
F8
•
19
9
z = 10x₁ + 10x₂
and S3 =
►►►
x₁ ≥0, x₂ 20
F9
8x₁ + 2x₂ ≤24
5X+X2 540
2x₁ + 2x₂ ≤26
Clear all
O
1
F10
Check ans
1
P
4)
F11

Expert Solution

Step 1

Consider the provided LPP,

$M a x z = 10 x_{1} + 10 x_{2} s u b j e c t e d t o : 8 x_{1} + 2 x_{2} \leq 24 5 x_{1} + x_{2} \leq 40 2 x_{1} + 2 x_{2} \leq 26 w i t h x_{1} \geq 0, x_{2} \geq 0$

Solve the given LPP,

The problem is converted to canonical form by adding slack, surplus and artificial variables as appropriate,

After introducing the slack variables the LPP is written as,

$M a x z = 10 x_{1} + 10 x_{2} + 0 S_{1} + 0 S_{2} + 0 S_{3} s u b j e c t e d t o : 8 x_{1} + 2 x_{2} + S_{1} = 24 5 x_{1} + x_{2} + S_{2} = 40 2 x_{1} + 2 x_{2} + S_{3} = 26 w i t h x_{1}, x_{2}, S_{1}, S_{2}, S_{3} \geq 0$