Question

Solve the following LP problem using simplex method:

Maximize z = 6x1 + 4x2

Subject to 2x1 + 3x2 ≤ 30

                 3x1 + 2x2 ≤ 24

                  x1 + x2 ≥ 3

                  x1 , x2 ≥ 0

20 Feb 2025
Answer :
Word Count : 265
हम इस लीनियर प्रोग्रामिंग (LP) समस्या को सिंप्लेक्स मेथड से हल करेंगे। समस्या निम्नलिखित है: Objective Function (लक्ष्य फ़ंक्शन): \[ \max Z = 6x_1 + 4x_2 \] Constraints (बाधाएँ): 1. \( 2x_1 + 3x_2 \leq 30 \) 2. \( 3x_1 + 2x_2 \leq 24 \) 3. \( x_1 + x_2 \geq 3 \) 4. \( x_1, x_2 \geq 0 \) ### Step 1: Inequalities को Standard Form में बदलना सिंप्लेक्स मेथड के लिए सभी constraints को बराबरी (\( = \)) के रूप में लिखना ज़रूरी होता है। इसके लिए, हम slack और artificial
____ __________ _________ ________ __________ ______ _______ _____.
_________ ___ ________ _________ ____.
_____ _________ _________ __________ __________ _____.
____ ________ ________ _________ ___.
_____ _____ ______ ____ ____ ______ _________ __________ _______ __________ __________.
__________ __________ ______ ________ ______ _________ ______ ____ ___ _________ ________.
______ _____ __________ _________ ______ ___ _____ ____ __________ __________.
__________ __________ ______ ____ ___ _______ ____.
_______ ________ _____ _______ ___ _________ ____ __________ _________ __________ ______.
__________ _________ ____ _______ ____ _____ _________.
_________ ________ ___ ____ __________ _______ ___.
____ ________ ___ ___ ____ _____ __________.
____ _____ _______ ___ ________ _______ _____ __________ ____.
_________ __________ ____ ___ ______ __________ _______ __________ _______ _________ _________ _________.
_________ ___ __________ _____ _________ _________ ________ ____ _______.
_____ ________ ____ ________ _______.
_______ _____ ______ _____ ________.
___ ______ _______ _______ _______ ____ _______.
___ ______ ________ _____ ______ _________ _________ __________ _____.
_____ ______ ______ _______ ___ __________ ___ __________ ____ __________.
__________ _____ ________ ________ ________ _________ ________ ______ ___ ___ __________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MTE 12 2025 - Solve the following LP problem using simplex method:Maximize z = 6 | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→