Use the graphical method to solve the following LPP:
Maximize:
z = 2x1 + 3x2
Subject to the constraints:
To solve the given Linear Programming Problem (LPP) using the graphical method, we'll follow these steps: ### Problem Statement: Maximize: \[ z = 2x_1 + 3x_2 \] Subject to the constraints: \[ x_1 + x_2 \leq 4 \] \[ 2x_1 + x_2 \leq 5 \] \[ x_1, x_2 \geq 0 \] ### Step 1: Plot the Constraints First, we'll plot each constraint on the \( x_1 \)-\( x_2 \) plane. 1. Constraint 1: \( x_1 + x_2 \leq 4 \) - When \( x_1 = 0 \), \( x_2 = 4 \). - When \( x_2 = 0 \), \( _____ ________ ________ ______ ____ __________.
__________ _____ _________ _______ _______ ______ ________ __________ _____ ___ __________.
__________ ______ _______ __________ ________ ______ ____ ________ ___ __________ ____.
_________ _____ __________ ___ ______ _______ _____ ______ _________ ______ ______.
_________ _______ _____ _____ _______ __________ _______ ____ _____.
________ ______ _____ _________ ___ __________ ___ ________.
__________ _____ ____ ________ ____ ____ ______ _________ _________.
________ ________ _____ ____ ________ _________ ______ ___.
_________ _____ ________ ____ ______ ____ ____ __________.
________ _________ _____ ________ ______ _________.
__________ ____ _________ ________ _________ ___ ____.
_______ ________ __________ ________ __________ _____ ___ ________ ________ _________ _____.
____ ________ __________ _____ __________ _________ __________ _____.
___ ________ _______ _________ __________.
__________ _________ _____ __________ ________ ______ _______.
_______ ______ ______ _________ _____ _________ _________ _____ _________ ___ _________.
____ ______ ____ ___ ______ _________ ________ ______ ____ ___ ____ __________.
_________ _____ __________ _____ ________ __________ ______ __________ ______ _________.
__________ _________ _______ __________ ________ ___.
_______ _________ ___ _____ _________ __________ ______.
________ _____ ______ __________ _________ _________.
______ _______ ___ __________ ______ _________ ____ ______ ____ _________.
_________ _________ _____ ____ __________ __________ ________ ________ ___ ________ ______.
_____ ______ _____ _______ __________.
_____ __________ __________ ____ ________ _____ ____ ___ _________.
___ _______ _______ _____ ____ _______ ________ _____.
_____ ___ _______ ______ __________ _____ ______ _________ ________ __________.
_________ _________ __________ ___ _________ _________ ________ ________ ___ ____.
_______ _________ _____ ________ ________ ___ ___.
_____ ___ ______ _____ ____ ________ ________ _______ ________ ___ ___.
____ _________ ______ ____ __________ _________ ___ __________.
________ _____ ______ ______ _____ _________ ___ _______ _________ _________ ________.
______ ________ ________ ________ ___ _____ _________ ______ __________ _____ ___.
___ ___ ________ _____ ______ ____ ________ _____ __________ ______ _____.
___ ______ _______ __________ __________ ______.
_________ _________ ____ ____ _____ ________ ________ ___ _____.
______ _______ ____ ________ ________ ___ __________ _______ ________.
___ _________ ____ _________ _____ ______ ______ _______ ___.
_________ __________ ____ ______ ____ ________ ______ _______ ______ ___ ______.
____ _______ ____ ________ __________ __________ _____ __________ __________ _____ ______ _____.
__________ _______ _________ _______ ________ _________ ____.
______ _____ ______ _____ ______ __________ _________.
_______ _________ _______ ________ ____ __________ _______ ___ ____ __________.
_____ _______ ________ _____ __________ ___ _____ ____ _________ _____ _____ _________.
_____ _________ ____ ______ ______ __________ ______ _______ ___ __________ ___.
_____ ______ _____ _________ _________ ____ ______ ______ _________ _________ _____.
__________ ______ __________ ________ ______ _______ _______ ________ ________ ___ ______.
________ ________ _______ ________ _______ _________ ___ ________ _________.
______ _________ _______ _______ _______ ____ __________ ____ _________.
_________ _____ ______ ___ ______ ______ _________ _________.
_______ ______ _____ _____ _______ _______ ________.
____ ____ ___ ___ ___ ______ _________ _______ _________ _____ __________ _________.
___ ________ __________ __________ __________ ___ ________ _______ ________ ____ __________ ____.
___ ________ ____ ______ ____ _______ __________.
_________ ________ _________ _____ _______ ___ _________ __________ __________.
________ _________ _____.
Get Full Answer on WhatsApp
Obtain all the basic solutions to the following system of linear equations:
Which of the solutions are feasible? Justify.
Use two-phase method to solve the following LPP:
Maximize:
z = 3x1 + 2x2
Subject to the constraints:
Given x13 = 50units, x14 = 20 units, x21 = 55units, x31 = 30units, x2 = 35units and x34 = 25 units. Is it an optimal solution to the transportation problem:
एक फैक्टरी में 6 जॉब पूरी होनी है। प्रत्येक जॉब को दो मशीनों A और B से AB के क्रम में गुजरना है। जॉब का प्रत्येक मशीन पर प्रक्रिया काल दिया गया है। आपको वह अनुक्रम निकालना है जिससे कुल व्यतीत समय T न्यूनतम हो, T का मान क्या है?
| जॉब | मशीन A | मशीन B | ||||||||
| J1 | 1 | 5 | ||||||||
| J 2 | 3 | 6 | ||||||||
| J3 | 8 | 3 | ||||||||
| J 4 | 5 | 2 | ||||||||
| J5 | 6 | 2 | ||||||||
| J 6 | 3 | 10 | ||||||||
A project schedule has the following characterizing:
i) Construct PERT network.
ii) Find the critical path.
Use the graphical method to solve the following LPP:
Maximize:
z = 2x1 + 3x2
Subject to the constraints:
At present a company is purchasing an item ‘x’ from outside suppliers. The assumption of unit is 10000 units/year. The cost of the item is ₹ 5 per unit and the ordering cost is estimated to be ₹ 100 per order. The cost of carrying inventory is 25%. If the consumption rate is uniform, determine the economic order quantity.