Question
निम्नलिखित रैखिक प्रोग्रामिंग (एलपी) समस्या को एकल विधि का उपयोग करके हल करें:
z = 6x1 + 4x2 का अधिकतमीकरण कीजिए
जबकि 2x1 + 3x2 ≤ 30
3x1 + 2x2 ≤ 24
x1 + x2 ≥ 3
x1 , x2 ≥ 0
Answer :
Word Count : 330
_______ _____ _________ ________ ____ __________.
__________ _______ ______ ______ ____ _______.
_______ _________ __________ _________ ____ ________ __________ ________.
____ _______ ______ _______ ____ _______ ________ _____.
__________ _______ ____ _______ __________ _________ ____.
_____ _________ ______ __________ _______ ___ _________ ____ ________ __________ ______.
___ _________ _______ ____ _______ ____ ______ _____ _____.
___ ___ ________ ______ ______ _______ _____ _________ _____ _____ ________.
_________ _______ ___ ________ ______ ____ __________.
___ ___ _______ ___ _________.
_______ ______ ______ ________ ______ _______ __________.
________ _____ ___ _______ ________ ______ _____ _______ ______.
__________ ______ _____ _______ _________ ______ ______ ____ ___ ________ __________.
________ ______ __________ __________ _______.
________ ________ _____ _________ _____ _________ ___ ______ _________ __________.
___ ________ ________ _____ _________ _______ _____ ___ _______ ______.
___ _________ _________ _________ _______ ____.
___ _______ ______ _______ _______ _________ ________.
______ ____ ________ _____ ____ ________ _____ ___ _____ ___ ________ ____.
_________ ____ ______ _______ ____ _______.
_________ _____ ___ _______ _____ __________ __________.
______ _______ __________ _________ ________ __________ _____ _________ ________.
________ _______ _________ ______ _______ ___ _____.
_____ __________ __________ ___ _____ ________ __________ _________ ______.
__________ _______ _________ _______ ________ ______ __________ ________ ________ ______.
_______ __________ ________ ______ _________ ________ _____ ____ _______.
________ _____ __________ _________ ______ ____ ________ __________.
___ __________ _____ __________ ______.
__________ ___ ______ _______ ____.
___ ___ ________ _______ _________.
__________ _____ _____ _______ _______ ______ _______.
______ _____ ____ _________ _____ __________ _______ _________ ________ ___ _____.
_________ ____.
Skip in 10
हम इस रैखिक प्रोग्रामिंग समस्या को एकल विधि (Simplex Method) का उपयोग करके हल करेंगे। ### समस्या: अधिकतम करना है: \[ z = 6x_1 + 4x_2 \] सशर्त: \[ 2x_1 + 3x_2 \leq 30 \] \[ 3x_1 + 2x_2 \leq 24 \] \[ x_1 + x_2 \geq 3 \] और \[ x_1, x_2 \geq 0 \] ### 1. सामान्य रूप में कन्वर्ट करना: पहले, सभी असमानताओं को समानताओं में
_____ ______ _________ _________ _________ _____._______ _____ _________ ________ ____ __________.
__________ _______ ______ ______ ____ _______.
_______ _________ __________ _________ ____ ________ __________ ________.
____ _______ ______ _______ ____ _______ ________ _____.
__________ _______ ____ _______ __________ _________ ____.
_____ _________ ______ __________ _______ ___ _________ ____ ________ __________ ______.
___ _________ _______ ____ _______ ____ ______ _____ _____.
___ ___ ________ ______ ______ _______ _____ _________ _____ _____ ________.
_________ _______ ___ ________ ______ ____ __________.
___ ___ _______ ___ _________.
_______ ______ ______ ________ ______ _______ __________.
________ _____ ___ _______ ________ ______ _____ _______ ______.
__________ ______ _____ _______ _________ ______ ______ ____ ___ ________ __________.
________ ______ __________ __________ _______.
________ ________ _____ _________ _____ _________ ___ ______ _________ __________.
___ ________ ________ _____ _________ _______ _____ ___ _______ ______.
___ _________ _________ _________ _______ ____.
___ _______ ______ _______ _______ _________ ________.
______ ____ ________ _____ ____ ________ _____ ___ _____ ___ ________ ____.
_________ ____ ______ _______ ____ _______.
_________ _____ ___ _______ _____ __________ __________.
______ _______ __________ _________ ________ __________ _____ _________ ________.
________ _______ _________ ______ _______ ___ _____.
_____ __________ __________ ___ _____ ________ __________ _________ ______.
__________ _______ _________ _______ ________ ______ __________ ________ ________ ______.
_______ __________ ________ ______ _________ ________ _____ ____ _______.
________ _____ __________ _________ ______ ____ ________ __________.
___ __________ _____ __________ ______.
__________ ___ ______ _______ ____.
___ ___ ________ _______ _________.
__________ _____ _____ _______ _______ ______ _______.
______ _____ ____ _________ _____ __________ _______ _________ ________ ___ _____.
_________ ____.
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.