Question
Use dual simplex method to solve the following LPP:
Minimize:
z = 3x1 + x2
Subject to the constraints:
Answer :
Word Count : 787
To solve the given Linear Programming Problem (LPP) using the Dual Simplex Method, we first need to convert the problem into its standard form. The problem is: Minimize: \[ z = 3x_1 + x_2 \] Subject to the constraints: \[ 2x_1 + x_2 \geq 4 \] \[ x_1 + 2x_2 \geq 6 \] \[ x_1, x_2 \geq 0 \] ### Step 1: Convert to Standard Form The standard form requires all constraints to be equalities with non-negative right-hand sides. We introduce surplus variables \( s_1 \) and \( s_2 \) to convert the inequalities: \[ 2x_1 + x_2 - s_1 = 4 \] \[ x_1 + 2x_2 - s_2 = 6 \] \[ x_1, x_2, s_1, s_2 \geq 0 \] ### Step 2: Initial Tableau The initial tableau for the Dual Simplex Method is constructed as follows: \[ \begin{array}{cccccc|c} & x_1 & x_2 & s_1 & s_2 & \text{RHS} \\ \hline z & -3 & -1 & ____ _______ _____ ________ ______.
______ ___ ______ ________ ______.
___ _______ ________ __________ ______ ___ __________ ____ _________ ______ __________ _______.
_________ _____ __________ _____ __________ ________ _____ _____ ______.
___ ______ ___ ________ ______ _____ _____ ___ _____.
_________ _________ ________ ______ ____ _______ ____ ______ __________ ________ _________.
________ ____ _________ _______ ________.
_____ __________ _________ ____ ___ ________ _________.
________ ____ _______ _____ ____ __________ ____ ___ ____.
_______ __________ _____ ________ _____ ______ _________ _______ ___ ___ ______.
_______ _________ _____ _________ _______ _______ ____ _____.
_________ _________ _________ ____ ___ _________ ______ __________ _______ _________.
_____ ___ __________ __________ ______ _______ _______ __________ _________ ____.
_________ ____ _______ _______ _______.
______ _____ _________ ________ ___ ____ _______ _____ ______ ___.
__________ _____ ___ ______ ___ ___ ______ _______ ________.
_____ ____ ________ ___ ______ ___ _______ ________.
___ _________ ____ _______ _______ _________ _____ _______ ______ _________.
_______ ____ __________ _______ ______ _______.
________ ____ ____ _________ __________.
____ ___ _________ _________ _________ __________.
____ ___ ____ _____ __________ ____ _____ _______ __________ _____ ___.
_______ _______ _________ __________ ___.
____ ________ ________ ______ ________ ______ _________ ____ ______ _______ _________ _____.
_____ ____ _____ ____ _____ ______ ______ __________ ________ _________ _____ _____.
_______ __________ _________ _______ _________ _____ _______ _________.
________ ________ _______ _________ __________.
_______ ________ _____ _________ ________.
________ ________ ___ ________ __________ ___ ____ _____.
__________ _______ _______ ______ _________ ______ ____ ________.
____ __________ _________ __________ _____ ________ ____ _______ ____ _______ _____ _______.
___ __________ _________ ___ ____ _________ _______.
__________ _______ ________ _________ ____ _________ _____ ______ ______ __________.
____ ______ ___ _______ ________ ________ ________ __________ ___ ___ ______ ________.
____ _________ ______ _______ ______ _________ ______ __________ _______ ___ ______.
_____ ________ _________ _______ _______ _____ _______ _______ _________ _____ ________ ______.
_____ _______ ________ ____ _________ ______ _______ __________ ________.
___ _____ ________ ____ ____ _______ ________.
_____ __________ ________ _______ _______ ___ _____ ____ _____ ____ __________.
________ ___ _________ _______ _______ ____ __________ _____ ______.
___ _______ ____ _______ ____ ____ _____ _____ ____.
________ _____ _________ ______ ____.
___ ______ _________ ____ ___ ______.
_________ __________ ________ ______ ____ ____ _______ _________ ____.
___ ______ _________ ______ _________ ____ _________ __________ _____ __________ ___.
__________ _______ __________ ________ ____.
__________ _____ _________ _____ ______ _______ _________ ________ ________ _________.
_________ _______ ________ ________ __________ ________ ____.
___ _________ _____ __________ _________ ___ ____.
____ _____ ____ ________ _______ ________ ______ _______ ______.
________ _____ _________ ___ _____ ________ ____ ______ ______ _________ ________.
________ _________ _________ _____ __________ _____ _______ _____ ____ _______.
____ ______ _________ ___ ___ ____.
____ _______ ____ ________ ______ ______.
_____ __________ ______ _________ _________ __________ ____ _____ ____ __________ ________ _____.
___ _________ ____ ________ _________ ____ ___ ________ _________ __________.
______ _____ ______ ______ ____ _______ ________ __________ ____ __________ ____.
_______ __________ ________ ______ _____ _________ ___ _________.
_________ __________ ____ _________ _______ ____ _________.
______ _______ ____ __________ _________ ________ _____.
__________ ______ __________ ______ ________ _____ ___ _____ ____ _____.
____ _________ ______ _________ ________ ______ ____ _______ _________ ______ ________ _______.
_________ ________ ______ _______ ________ ___.
_______ _______ ________ ______ ___ ____ _________ ___ ______ _________ _________ ________.
___ __________ _____ ________ __________.
___ _______ ___ ________ ____ _____ _______ _______ ___ _______ ___ ____.
_____ _______ _____ _________ ___ ___ _______ _______ ________ ______ _________.
_______ ________ ______ _____ ______ __________ ___ __________ _______ _________ ______.
___ __________ __________ ________ ____ ___ _____ _____ ______ _______.
_________ ____ _____ ______ ________ __________ _______.
___ ______ _______ ______ ___ _________.
__________ ______ ______ _________ _____ _____ ___ ________ _______.
_______ _______ _______ _____ ____ ____ ________ __________.
_________.
Get Full Answer on WhatsApp
To solve the given Linear Programming Problem (LPP) using the Dual Simplex Method, we first need to convert the problem into its standard form. The problem is: Minimize: \[ z = 3x_1 + x_2 \] Subject to the constraints: \[ 2x_1 + x_2 \geq 4 \] \[ x_1 + 2x_2 \geq 6 \] \[ x_1, x_2 \geq 0 \] ### Step 1: Convert to Standard Form The standard form requires all constraints to be equalities with non-negative right-hand sides. We introduce surplus variables \( s_1 \) and \( s_2 \) to convert the inequalities: \[ 2x_1 + x_2 - s_1 = 4 \] \[ x_1 + 2x_2 - s_2 = 6 \] \[ x_1, x_2, s_1, s_2 \geq 0 \] ### Step 2: Initial Tableau The initial tableau for the Dual Simplex Method is constructed as follows: \[ \begin{array}{cccccc|c} & x_1 & x_2 & s_1 & s_2 & \text{RHS} \\ \hline z & -3 & -1 & ____ _______ _____ ________ ______.
______ ___ ______ ________ ______.
___ _______ ________ __________ ______ ___ __________ ____ _________ ______ __________ _______.
_________ _____ __________ _____ __________ ________ _____ _____ ______.
___ ______ ___ ________ ______ _____ _____ ___ _____.
_________ _________ ________ ______ ____ _______ ____ ______ __________ ________ _________.
________ ____ _________ _______ ________.
_____ __________ _________ ____ ___ ________ _________.
________ ____ _______ _____ ____ __________ ____ ___ ____.
_______ __________ _____ ________ _____ ______ _________ _______ ___ ___ ______.
_______ _________ _____ _________ _______ _______ ____ _____.
_________ _________ _________ ____ ___ _________ ______ __________ _______ _________.
_____ ___ __________ __________ ______ _______ _______ __________ _________ ____.
_________ ____ _______ _______ _______.
______ _____ _________ ________ ___ ____ _______ _____ ______ ___.
__________ _____ ___ ______ ___ ___ ______ _______ ________.
_____ ____ ________ ___ ______ ___ _______ ________.
___ _________ ____ _______ _______ _________ _____ _______ ______ _________.
_______ ____ __________ _______ ______ _______.
________ ____ ____ _________ __________.
____ ___ _________ _________ _________ __________.
____ ___ ____ _____ __________ ____ _____ _______ __________ _____ ___.
_______ _______ _________ __________ ___.
____ ________ ________ ______ ________ ______ _________ ____ ______ _______ _________ _____.
_____ ____ _____ ____ _____ ______ ______ __________ ________ _________ _____ _____.
_______ __________ _________ _______ _________ _____ _______ _________.
________ ________ _______ _________ __________.
_______ ________ _____ _________ ________.
________ ________ ___ ________ __________ ___ ____ _____.
__________ _______ _______ ______ _________ ______ ____ ________.
____ __________ _________ __________ _____ ________ ____ _______ ____ _______ _____ _______.
___ __________ _________ ___ ____ _________ _______.
__________ _______ ________ _________ ____ _________ _____ ______ ______ __________.
____ ______ ___ _______ ________ ________ ________ __________ ___ ___ ______ ________.
____ _________ ______ _______ ______ _________ ______ __________ _______ ___ ______.
_____ ________ _________ _______ _______ _____ _______ _______ _________ _____ ________ ______.
_____ _______ ________ ____ _________ ______ _______ __________ ________.
___ _____ ________ ____ ____ _______ ________.
_____ __________ ________ _______ _______ ___ _____ ____ _____ ____ __________.
________ ___ _________ _______ _______ ____ __________ _____ ______.
___ _______ ____ _______ ____ ____ _____ _____ ____.
________ _____ _________ ______ ____.
___ ______ _________ ____ ___ ______.
_________ __________ ________ ______ ____ ____ _______ _________ ____.
___ ______ _________ ______ _________ ____ _________ __________ _____ __________ ___.
__________ _______ __________ ________ ____.
__________ _____ _________ _____ ______ _______ _________ ________ ________ _________.
_________ _______ ________ ________ __________ ________ ____.
___ _________ _____ __________ _________ ___ ____.
____ _____ ____ ________ _______ ________ ______ _______ ______.
________ _____ _________ ___ _____ ________ ____ ______ ______ _________ ________.
________ _________ _________ _____ __________ _____ _______ _____ ____ _______.
____ ______ _________ ___ ___ ____.
____ _______ ____ ________ ______ ______.
_____ __________ ______ _________ _________ __________ ____ _____ ____ __________ ________ _____.
___ _________ ____ ________ _________ ____ ___ ________ _________ __________.
______ _____ ______ ______ ____ _______ ________ __________ ____ __________ ____.
_______ __________ ________ ______ _____ _________ ___ _________.
_________ __________ ____ _________ _______ ____ _________.
______ _______ ____ __________ _________ ________ _____.
__________ ______ __________ ______ ________ _____ ___ _____ ____ _____.
____ _________ ______ _________ ________ ______ ____ _______ _________ ______ ________ _______.
_________ ________ ______ _______ ________ ___.
_______ _______ ________ ______ ___ ____ _________ ___ ______ _________ _________ ________.
___ __________ _____ ________ __________.
___ _______ ___ ________ ____ _____ _______ _______ ___ _______ ___ ____.
_____ _______ _____ _________ ___ ___ _______ _______ ________ ______ _________.
_______ ________ ______ _____ ______ __________ ___ __________ _______ _________ ______.
___ __________ __________ ________ ____ ___ _____ _____ ______ _______.
_________ ____ _____ ______ ________ __________ _______.
___ ______ _______ ______ ___ _________.
__________ ______ ______ _________ _____ _____ ___ ________ _______.
_______ _______ _______ _____ ____ ____ ________ __________.
_________.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★