Question
निम्नलिखित आद्य रैखिक प्रोग्रामन (LP) समस्या की द्वैती प्राप्त कीजिए :
z = x1 - 2x2 + 3x3 का अधिकतमीकरण कीजिए
जबकि -2x1 + x2 + 3x3 = 2
2x + 3x2 + 4x3 =1
X1,X2X2 ≥ 0
Answer :
Word Count : 246
___ __________ ___ _____ ____ ________ ______ ________ _______ ___.
_____ _______ _______ _________ ________ _________ ____.
____ _______ ________ _______ __________.
_________ ______ _________ ________ ______ _____ __________ ____ _______ _____ ___.
___ ______ ________ ___ _________ _____ _________ ________ ________ _________ __________.
_____ _________ ___ _____ __________ _________ _____.
_______ ________ ______ ____ _____.
___ ______ ____ _________ ___ _________ _____ _________ _______ ___ ____.
________ ____ ______ ____ __________ _____ _____ ________ _____ __________ ___.
_______ __________ ______ _____ _____ ___ ___ _______ ______.
________ _________ __________ _______ _____ __________ ______.
_______ ___ ______ _______ ______ ______ _____ _____.
___ ___ ___ _________ ________ _____.
__________ __________ ______ ________ ____ _____ __________ _________ __________ _______ __________ __________.
___ ____ _____ ____ _____ ______ ____ ____ ______ ___ _________.
_________ ___ ______ _________ _________ ____ ______ ________ ___ _______.
___ _______ _________ ____ __________ _________ _____ ____ ____ ____ _______.
_________ ______ ____ ____ ___.
Skip in 10
आपने जो रैखिक प्रोग्रामन (LP) समस्या दी है, उसे द्वैतीय प्राप्त करने के लिए हमें सबसे पहले इसे द्वैतीय रूप में बदलना होगा। द्वैतीय रूप (dual) निकालने के लिए, निम्नलिखित कदम हैं: 1. प्रारंभिक रूप (Primal form): - अधिकतम उद्देश्य समारोह: \( z = x_1 - 2x_2 + 3x_3 \) - प्रतिबंध: \[ -2x_1 + x_2 + 3x_3 = 2 \] \[ 2x_1 + 3x_2 + 4x_3 = 1 \] - साथ ही \( x_1, x_2, x_3 \geq 0
__________ _______ __________ ______ ______ __________ _____ _________ _________ ____.___ __________ ___ _____ ____ ________ ______ ________ _______ ___.
_____ _______ _______ _________ ________ _________ ____.
____ _______ ________ _______ __________.
_________ ______ _________ ________ ______ _____ __________ ____ _______ _____ ___.
___ ______ ________ ___ _________ _____ _________ ________ ________ _________ __________.
_____ _________ ___ _____ __________ _________ _____.
_______ ________ ______ ____ _____.
___ ______ ____ _________ ___ _________ _____ _________ _______ ___ ____.
________ ____ ______ ____ __________ _____ _____ ________ _____ __________ ___.
_______ __________ ______ _____ _____ ___ ___ _______ ______.
________ _________ __________ _______ _____ __________ ______.
_______ ___ ______ _______ ______ ______ _____ _____.
___ ___ ___ _________ ________ _____.
__________ __________ ______ ________ ____ _____ __________ _________ __________ _______ __________ __________.
___ ____ _____ ____ _____ ______ ____ ____ ______ ___ _________.
_________ ___ ______ _________ _________ ____ ______ ________ ___ _______.
___ _______ _________ ____ __________ _________ _____ ____ ____ ____ _______.
_________ ______ ____ ____ ___.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.