Question

Use branch and bound method to solve the following LPP:

Minimize: Z = 4x1 + 3x2

Subject to the constraints:

 

equation
equation
equation
equation and are integers.

09 Jan 2026
Answer :
Word Count : 591
Minimize: ( Z = 4x_1 + 3x_2 ) Subject to: ( 5x_1 + 3x_2 \geq 30 ), ( x_1 \leq 4 ), ( x_2 \leq 6 ), ( x_1, x_2 \geq 0 ) and integers. Step 1: Solve the relaxed LPP (ignore integer constraints). Constraints: 1. ( 5x_1 + 3x_2 \geq 30 ) → ( x_2 \geq \frac{30 - 5x_1}{3} ) 2. ( x_1 \leq 4 ) 3. ( x_2 \leq 6 ) 4. ( x_1, x_2 \geq 0 ) Step 2: Find feasible region vertices. * Intersection of ( 5x_1 + 3x_2 = 30 ) and ( x_1 = 4 ): ( 5(4) + 3x_2 = 30 ) → ( 20 + 3x_2 = 30 ) → ( 3x_2 = 10 ) → ( x_2 = \frac{10}{3} \approx 3.333 ) → Z = ( 4*4 + 3*(10/3) = 16 + 10 = 26 ) * Intersection of ( 5x_1 + 3x_2 = 30 ) and ( x_2 = 6 ): ( 5x_1 + 3*6 = 30 ) → ( 5x_1 + 18 = 30 ) →
____ ____ ___ __________ ______ _________ ____ _________ _____ ___ __________ _________.
_____ _________ ____ ____ __________ ________ _________ ________ _______ __________.
______ _________ ____ ________ _____ ___ _________ _______ ______ __________ ___.
________ _____ ______ _______ _______ ____ ___ ________ _______ _______ _________.
__________ ______ _______ ____ __________ _____ ________ _______ __________ ___ _____ _______.
_______ ________ _______ _________ ______ _______ _______ _____ ___ ________.
__________ ______ ________ ___ __________ _________ _______ _______ ______ ________ _______.
______ _________ __________ _____ ___ ________ ______.
_____ __________ ________ ____ ________ ____ _________ ____ _______.
______ ________ _________ _________ _____ ___ ____ _____ ___ __________ ______ _________.
__________ ________ ____ _________ _______ ____ ___ _________ _________ __________.
_______ ________ ___ _______ _________ ___ ______ __________ _______ ___.
__________ ________ _____ ____ _________ ______ ____ _________ ______ __________ _______ __________.
________ ________ ____ ______ ____ __________ _________ ________.
________ ______ ________ _____ _______ ______ _________.
_________ _____ _____ ___ ___ __________ __________ ____ _____ __________ ________.
__________ _________ _________ __________ ____.
___ ___ _________ ______ ____ _______ _________ ______ __________ __________ _______ ________.
______ ____ _____ _______ ___.
__________ ___ ________ __________ ____ _______ ___ _______ ______.
_____ ______ ________ _______ ____ _________ _______.
_____ _________ __________ _______ _______ ____ _____ ________ ___.
__________ _________ ___ _________ ___ ______ __________ _______ ___ _______ _________.
______ ______ ______ ______ _______ _______ _____ __________ _______.
___ _______ ________ ________ ___ _________ _______.
_____ _____ __________ ________ _________ _________ __________ ________ _____ ______ _____.
__________ _____ ___ __________ _______ ____ ________ ____ ____ _______.
____ __________ __________ _________ ________ ______ __________ ___ _________.
______ ______ _____ _______ __________ _________ ________ ______.
_________ ____ ________ __________ ___ _________ _________ _______.
_____ ______ _______ _________ ____ __________ ________.
_________ _________ _______ _________ ___ ______ _________.
_________ ________ _____ __________ ___ ________ ____ __________ ___ ________ _________ ______.
___ ________ _____ _____ ______.
_____ ___ ______ ___ _____ __________ _____ ______.
___ _____ _____ ___ ____ _________ ____ ___ ___ ________.
_____ ____ ____ ___ ___ __________.
____ _____ ________ ______ ________ __________ ________.
_______ __________ ___ __________ __________ ____ ______ ______ ___ ____.
_________ _______ _________ __________ _______.
___ _____ ________ __________ ____ ____ ______ __________ ____ ___.
________ ______ _____ ________ _________ ___ ______ ________ _______.
_______ _________ ____ _______ ___ ____ _________ _____ _________.
__________ ____ ___ __________ __________ ____ __________ ________ _____ ____ ____ ____.
____ ___ _____ __________ _________ ___ _________.
_______ ______ __________ _____ ____ __________ ___.
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 AOR 1 2026 - Use branch and bound method to solve the following LPP:Minimize: Z | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→