Question
Obtain the dual of the following primal LP problem:
Maximize z = x1 - 2x2 + 3x3
Subject to -2x1 + x2 + 3x3 = 2
2x + 3x2 + 4x3 =1
X1,X2X2 ≥ 0
Answer :
Word Count : 326
To obtain the dual of the given primal Linear Programming (LP) problem, we follow these steps: ### Step 1: Identify Primal Problem #### Primal LP: \[ \text{Maximize } z = x_1 - 2x_2 + 3x_3 \] Subject to: \[ -2x_1 + x_2 + 3x_3 = 2 \] \[ 2x_1 + 3x_2 + 4x_3 = 1 \] \[ x_1, x_2, x_3 \geq 0 \] ### Step 2: Formulate the Dual Problem - The primal has two equality constraints, so the dual will ________ ____ _______ ____ ___.
____ ______ _____ _______ ____.
_____ _______ ______ ___ __________ _____ ______ _______.
_______ _______ _________ _____ _________ ________ _________.
__________ ________ __________ ___ ________ _________ _________ _______ _____.
______ ____ ___ ___ _________ ______ ___ __________.
_____ ___ _________ ______ __________ _____ ________ ____.
_____ ______ _______ _______ _____ ____ ________ ___ ______ _______.
_____ ___ _____ __________ ______ ______ _____ _________ ______ _____ _____ _______.
____ _______ ________ _______ __________ ______ ________ ________.
____ _________ __________ _________ _______ ____.
_________ ___ ______ ____ ______ _______ ____ ______ _______ __________ _________.
_________ ___ ______ _________ _________ ____ ________ _____ _______ _______ ___ ___.
______ _______ ____ ________ _____ ______ ___ ___ __________ ___ ____.
_______ _______ _________ _______ ______.
_________ ____ __________ __________ ____ _________ ________.
__________ __________ _____ ___ __________ ____ ______ _________ ________ ____ ___.
____ ____ _______ _________ __________.
________ ________ __________ _____ _____ __________ _____ _________ _____.
________ _________ __________ __________ ________ ____ __________ __________ _____ ________ ________.
______ _____ ________ ___ _______.
______ _______ __________ ____ _____ ________ __________ ____ ____ _________ ___ ________.
__________ _________ ___ _____ ____ __________ _______ __________ ____.
________ ______ _________ _____ _______ _________ ___ _______ _________ ____ ______ ________.
_________ _________ __________ _______ __________.
________ ___ ______ __________ ____ ________ _____ ________ __________ __________ ____.
____ ________ _____ ______ __________ _________ ______ ____ _____ _____ __________.
___ _________ ________ _______ ________ _______ _____ __________ ___ ___.
____ _______.
Get Full Answer on WhatsApp
To obtain the dual of the given primal Linear Programming (LP) problem, we follow these steps: ### Step 1: Identify Primal Problem #### Primal LP: \[ \text{Maximize } z = x_1 - 2x_2 + 3x_3 \] Subject to: \[ -2x_1 + x_2 + 3x_3 = 2 \] \[ 2x_1 + 3x_2 + 4x_3 = 1 \] \[ x_1, x_2, x_3 \geq 0 \] ### Step 2: Formulate the Dual Problem - The primal has two equality constraints, so the dual will ________ ____ _______ ____ ___.
____ ______ _____ _______ ____.
_____ _______ ______ ___ __________ _____ ______ _______.
_______ _______ _________ _____ _________ ________ _________.
__________ ________ __________ ___ ________ _________ _________ _______ _____.
______ ____ ___ ___ _________ ______ ___ __________.
_____ ___ _________ ______ __________ _____ ________ ____.
_____ ______ _______ _______ _____ ____ ________ ___ ______ _______.
_____ ___ _____ __________ ______ ______ _____ _________ ______ _____ _____ _______.
____ _______ ________ _______ __________ ______ ________ ________.
____ _________ __________ _________ _______ ____.
_________ ___ ______ ____ ______ _______ ____ ______ _______ __________ _________.
_________ ___ ______ _________ _________ ____ ________ _____ _______ _______ ___ ___.
______ _______ ____ ________ _____ ______ ___ ___ __________ ___ ____.
_______ _______ _________ _______ ______.
_________ ____ __________ __________ ____ _________ ________.
__________ __________ _____ ___ __________ ____ ______ _________ ________ ____ ___.
____ ____ _______ _________ __________.
________ ________ __________ _____ _____ __________ _____ _________ _____.
________ _________ __________ __________ ________ ____ __________ __________ _____ ________ ________.
______ _____ ________ ___ _______.
______ _______ __________ ____ _____ ________ __________ ____ ____ _________ ___ ________.
__________ _________ ___ _____ ____ __________ _______ __________ ____.
________ ______ _________ _____ _______ _________ ___ _______ _________ ____ ______ ________.
_________ _________ __________ _______ __________.
________ ___ ______ __________ ____ ________ _____ ________ __________ __________ ____.
____ ________ _____ ______ __________ _________ ______ ____ _____ _____ __________.
___ _________ ________ _______ ________ _______ _____ __________ ___ ___.
____ _______.
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★★★