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 & 0 & 0 & 0 \\ \hline s_1 & -2 & -1 & 1 & 0 & -4 \\ s_2 & -1 & -2 & 0 & 1 & -6 \\ \end{array} \] ### Step 3: Identify the Pivot _________ _____ ______ ________ ____ ________ ________ ___.
___ __________ ___ ______ __________ _____ _____ ______.
____ __________ _________ __________ _______ __________ _________ __________ ______.
______ _____ ______ ___ _______ _____ _______ ______ ___ ______ ________.
______ ________ ____ ________ ______ _____ __________ ____.
_______ ______ ______ ___ ______.
_________ __________ __________ ____ ______ ________ _____ ___ ________ ____ ______.
____ ________ ________ _______ _________ _____ _________ _______ _________.
_________ _______ ____ ____ ____.
______ ________ ___ ___ _____.
____ ____ __________ _____ ________ ___ _______ ___ _____.
________ _______ ________ ___ __________ _______ ______ ____.
__________ ____ _______ ____ _________ __________ _________ __________ ____ _______ ______.
_________ _______ ___ _____ _____ ____ _________ __________ ____ _______ _____.
______ __________ _________ _____ _____ __________ __________ _________ ____ _____ _____.
__________ __________ ________ ____ __________ _________ __________ ___ _______ ___.
________ _______ _______ __________ ___ __________ _________ _______ ______.
________ ____ ______ _________ __________ _________ _________ ____ ____.
_____ _________ ___ ____ _________ ___ ____ _____ ____ ________.
___ ______ ___ __________ _______.
____ ______ _______ _____ _____ ___ __________ _____ __________ ________ ____ __________.
_______ _______ ___ ____ _________ ___ ______ _______ ___ _________.
_____ _____ ____ _______ ____ _________ ________ ___ ____ ______ _______.
____ ___ _______ __________ _______ ___ __________ ___ _______ _________.
_____ _____ _______ __________ ____ ______ _______ __________.
_________ _____ ______ ______ __________ ____.
________ ________ ___ _________ __________ ________ ______.
________ ____ ___ ____ __________ _________.
______ ___ ______ _______ ___ ______ ___ _______ ________ _________ _______.
_________ ______ __________ _______ __________ __________ ______ _________ ____.
____ ___ _______ ___ _______ ___ ____ ______ _____ __________ ________ ______.
_______ _______ ___ _____ ______ __________ _______ _________.
____ _________ _______ __________ ____ ___ _________ _____ ______ ____ ____.
_____ _________ ______ _________ ________ ______ ________ ________ ________ _______ ______.
____ _______ _________ ____ ________ ____ ______ _______ ______ ______ _________.
__________ _________ ___ ____ _____ _______.
_________ _________ _______ _____ __________ ___ _________ _________ _________.
_____ ______ ________ _______ _____ __________ _________ ______ _______.
_________ ______ _______ ______ _________ ____ __________ ___ ________ _____.
____ ______ ______ ______ ___ _________ _________ ___ ______.
___ ____ ________ ______ ________ ________ ______ ________ _____.
___ _____ _______ __________ _____ _____ ____ ____ ____ __________ __________ ________.
_____ ___ ___ ___ ____ ________ _________ ____ ___ ___ _____ __________.
_________ __________ ____ _____ __________ _______ ____ ____ _________.
____ ___ _____ ________ __________ _________ _________ _____ _________ ____.
_____ _____ _____ ____ _____ _________ __________ _____ __________ _________ _______.
______ ______ ____ ___ ____ _____ _________ __________.
____ _______ ______ ___ ___ ________ _____ __________ ________ _________.
___ ___ ________ __________ _____ __________ ______ _____ _____.
_________ ____ _________ _________ ____ _______ ________.
_____ __________ __________ _____ _____ ___ ____ ____ _________ ______.
____ ______ ___ _______ ______ ________ _________ ___ ____ ____ ___.
_______ _____ _____ __________ ____ _______ __________ _________ _______ __________ _________.
____ ________ __________ _________ ______ ________ ___.
_____ _________ ___ _____ ______ __________ ______ _____ _____ _____ _______ _______.
_____ _______ ___ ______ ______ ___ _________ ______ _____ ____.
__________ _________ __________ _______ _____ _________ _____.
________ ___ ______ ______ ______ ______ _______ ___ _______ ______ _______ ______.
_________ __________ ___ ______ ______ _____ _________ _______ ___ ____.
_____ ___ ________ ______ ________ ________ ___ ___ __________ ____ ________ ____.
_______ _________ ____ ______ _______ _____ _____ __________ __________ ____.
____ ________ ____ _____ __________.
_______ __________ ______ _______ __________ ____ ______ _____ ___.
________ _______ _________ ____ _______.
___ ___ __________ _______ ________.
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 & 0 & 0 & 0 \\ \hline s_1 & -2 & -1 & 1 & 0 & -4 \\ s_2 & -1 & -2 & 0 & 1 & -6 \\ \end{array} \] ### Step 3: Identify the Pivot _________ _____ ______ ________ ____ ________ ________ ___.
___ __________ ___ ______ __________ _____ _____ ______.
____ __________ _________ __________ _______ __________ _________ __________ ______.
______ _____ ______ ___ _______ _____ _______ ______ ___ ______ ________.
______ ________ ____ ________ ______ _____ __________ ____.
_______ ______ ______ ___ ______.
_________ __________ __________ ____ ______ ________ _____ ___ ________ ____ ______.
____ ________ ________ _______ _________ _____ _________ _______ _________.
_________ _______ ____ ____ ____.
______ ________ ___ ___ _____.
____ ____ __________ _____ ________ ___ _______ ___ _____.
________ _______ ________ ___ __________ _______ ______ ____.
__________ ____ _______ ____ _________ __________ _________ __________ ____ _______ ______.
_________ _______ ___ _____ _____ ____ _________ __________ ____ _______ _____.
______ __________ _________ _____ _____ __________ __________ _________ ____ _____ _____.
__________ __________ ________ ____ __________ _________ __________ ___ _______ ___.
________ _______ _______ __________ ___ __________ _________ _______ ______.
________ ____ ______ _________ __________ _________ _________ ____ ____.
_____ _________ ___ ____ _________ ___ ____ _____ ____ ________.
___ ______ ___ __________ _______.
____ ______ _______ _____ _____ ___ __________ _____ __________ ________ ____ __________.
_______ _______ ___ ____ _________ ___ ______ _______ ___ _________.
_____ _____ ____ _______ ____ _________ ________ ___ ____ ______ _______.
____ ___ _______ __________ _______ ___ __________ ___ _______ _________.
_____ _____ _______ __________ ____ ______ _______ __________.
_________ _____ ______ ______ __________ ____.
________ ________ ___ _________ __________ ________ ______.
________ ____ ___ ____ __________ _________.
______ ___ ______ _______ ___ ______ ___ _______ ________ _________ _______.
_________ ______ __________ _______ __________ __________ ______ _________ ____.
____ ___ _______ ___ _______ ___ ____ ______ _____ __________ ________ ______.
_______ _______ ___ _____ ______ __________ _______ _________.
____ _________ _______ __________ ____ ___ _________ _____ ______ ____ ____.
_____ _________ ______ _________ ________ ______ ________ ________ ________ _______ ______.
____ _______ _________ ____ ________ ____ ______ _______ ______ ______ _________.
__________ _________ ___ ____ _____ _______.
_________ _________ _______ _____ __________ ___ _________ _________ _________.
_____ ______ ________ _______ _____ __________ _________ ______ _______.
_________ ______ _______ ______ _________ ____ __________ ___ ________ _____.
____ ______ ______ ______ ___ _________ _________ ___ ______.
___ ____ ________ ______ ________ ________ ______ ________ _____.
___ _____ _______ __________ _____ _____ ____ ____ ____ __________ __________ ________.
_____ ___ ___ ___ ____ ________ _________ ____ ___ ___ _____ __________.
_________ __________ ____ _____ __________ _______ ____ ____ _________.
____ ___ _____ ________ __________ _________ _________ _____ _________ ____.
_____ _____ _____ ____ _____ _________ __________ _____ __________ _________ _______.
______ ______ ____ ___ ____ _____ _________ __________.
____ _______ ______ ___ ___ ________ _____ __________ ________ _________.
___ ___ ________ __________ _____ __________ ______ _____ _____.
_________ ____ _________ _________ ____ _______ ________.
_____ __________ __________ _____ _____ ___ ____ ____ _________ ______.
____ ______ ___ _______ ______ ________ _________ ___ ____ ____ ___.
_______ _____ _____ __________ ____ _______ __________ _________ _______ __________ _________.
____ ________ __________ _________ ______ ________ ___.
_____ _________ ___ _____ ______ __________ ______ _____ _____ _____ _______ _______.
_____ _______ ___ ______ ______ ___ _________ ______ _____ ____.
__________ _________ __________ _______ _____ _________ _____.
________ ___ ______ ______ ______ ______ _______ ___ _______ ______ _______ ______.
_________ __________ ___ ______ ______ _____ _________ _______ ___ ____.
_____ ___ ________ ______ ________ ________ ___ ___ __________ ____ ________ ____.
_______ _________ ____ ______ _______ _____ _____ __________ __________ ____.
____ ________ ____ _____ __________.
_______ __________ ______ _______ __________ ____ ______ _____ ___.
________ _______ _________ ____ _______.
___ ___ __________ _______ ________.
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★★★