Solve the following LPP by simplex method:Max Subject to

Question

Solve the following LPP by simplex method:

Max $9x_{1} +7x_{2} +7x_{3}$

Subject to 3x1 $+ x_{2} +2x_{3} leq 12$

$x_{1},5 x_{2}, +3x_{3} leq 30$

$x_{1}, x_{2}, x_{3} geq 0.$

18 Mar 2023

Answer :

Word Count : 419

To solve the given linear programming problem using the simplex method, we first convert it into its standard form by introducing slack variables as follows:

Maximize z = 9x1 + 7x2 + 7x3

Subject to:

3x1 + x2 + 2x3 + x4 = 12

x1 + 5x2 + 3x3 + x5 = 30

x1, x2, x3, x4, x5 ≥ 0

We can now represent this problem in a tableau format as follows:

_____ ____ _________ __________ ________ _________ ________.
____ _______ _____ ________ _________ __________.
_______ _________ __________ ______ ____ ___ ______ _________ ____ _____ _____.
______ ________ ____ ________ ________ _____ ________ ________ _________ ______ ______.
_______ ____ ___ __________ __________.
____ __________ __________ _____ ______ ________.
___ ___ _______ _____ ________ ________ _________ ____ __________.
___ __________ ____ ____ __________ _____.
_____ _________ _________ _______ ________ ______ _________ ___ __________ __________ ________.
______ ___ ___ _____ ___.
__________ ___ _____ _______ ______ ________ _______ _____ _______.
________ _____ __________ ______ ____ ________.
________ ________ _______ ____ __________ _________ ___ ___ _____ _____.
___ ____ ______ ___ _________ _________ ________ _________ _________ __________.
_______ ___ ____ ______ __________ ________ _________ _______ _______.
____ ______ ________ ____ ____ ________ _____ ________.
__________ ____ __________ ___ __________ _____ _________ _______ __________ ______.
___ _________ ________ _________ ________ ____ ____.
__________ ___ _____ _______ _____ _____ ___ _________ ____ _______.
______ ________ ___ _____ ________ _____ ______ _____ __________ ________ _______.
___ ________ __________ ________ _______ ___ ______ ________ __________.
___ _________ ______ _____ ______ ___ ___ ________ ______.
________ _____ __________ ___ _________ ____ _______ __________ _____ _________ ________.
____ ____ ______ _____ ______.
____ _____ _________ _____ ____ _______ ____ ___ ________ ________ _________ ___.
_____ __________ _________ _______ _________.
_____ _________ _________ _______ _____ ____ _____.
________ ___ ______ _______ ____ ___ _________ ___ ____ _____.
_________ ______ ______ ____ __________.
____ _________ ______ ________ ______ _____ ____ ____.
________ _______ ____ __________ ___ _______ _______ ______ _______ __________.
________ ______ ___ ______ _______.
____ ____ __________ _____ ___ ____ _________ ____ _______ ________ _____ ___.
__________ __________ __________ _______ ________ _____ _________ ______ _________ _______ _________.
___ ____ __________ _________ ______.
__________ ___ ___ ______ _________ ____ ___.
________ ____ ______ ______ ______.
_______ __________ __________ ______ __________ ______ _______ _______ _______ ___ ________ _________.
_____ ________ ____ _______ __________.
_______ __________ ________ _____ _______ _________ __________ ________ ________.
_______ _________ _______ _______ ______ ____ ________.
Get Full Answer on WhatsApp

IGNOU Solved Assignments Assignments Ignou Projects Project Previous Year Solved Exam Papers Notes Notes Sample Question Papers Sample Question Papers

IGNOU NEWS

Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★

Top

📞

Call Support Instant phone assistance Solve the following LPP by simplex method:Max Subject to

→

🟢

WhatsApp Chat Fast live messaging

→

✉

Email Us Business enquiries & support

→

Basis	x1	x2	x3	x4	x5	RHS