Write the LPP formulation of the following transportation problem:
| Destination | Supply | |||
|---|---|---|---|---|
| $D_1$ | $D_2$ | $D_3$ | ||
| Source $O_1$ | 10 | 18 | 12 | 200 |
| Source $O_2$ | 15 | 17 | 9 | 300 |
| Source $O_3$ | 13 | 15 | 7 | 500 |
| Requirement | 400 | 200 | 400 |
b) Solve the following assignment problem for profit maximization:
Below is the complete solution to both parts. --- ## (a) Transportation Problem ### Data | Source \ Destination | D1 | D2 | D3 | Supply | | -------------------- | ------- | ------- | ------- | ------ | | S1 | 10 | 18 | 12 | 200 | | S2 | 15 | 17 | 9 | 300 | | S3 | 13 | 15 | 7 | 500 | | Demand | 400 | 200 | 400 | | Balanced problem Total supply = 200 + 300 + 500 = 1000 Total demand = 400 + 200 ____ ___ ___ ________ _________ _________ _______ __________ ______ _________ ________.
_______ _______ ____ ________ ___ ____ _______ _____ ___ _______.
_____ ______ __________ __________ _______ ______ ____ ___ _________ _______ ______ __________.
________ ______ _________ _____ ___ _______.
______ _____ ________ ___ ___ ________.
_________ _____ __________ _____ _______ _________ _____ __________ _______.
_______ ________ _________ _________ ___ __________ __________ ____ ___.
________ _________ _____ _____ ____ ____ _____ ____ _________ _________ _________ _____.
________ _________ _____ _________ _____ _______ _________ ____ _______ ______ _______ _____.
___ __________ _____ _________ ___ ___ _________ ___ __________ _____ _________ ______.
________ _________ _________ ______ _____ ______ ___.
_________ __________ ______ ____ _____ ___ ____ __________ ____ __________.
___ _______ _________ __________ ________ ___ ______.
____ _________ _______ ____ _____ _____.
_______ __________ ___ ___ ______ _________ ___ _________ _______ ________.
____ __________ _____ ________ ___ ________ __________ __________ ____ ____ __________ __________.
____ ________ __________ _____ ______ ____ ____ _____ __________ __________ __________ ___.
___ _________ ________ _______ __________ ____ _______ ____ ______ ______.
_____ _____ ___ _______ ________ ___ _____ ________ __________.
___ ____ ____ ___ _____ ____.
________ _________ ____ ________ ________ _______.
_________ ___ _______ __________ _____ ___ __________.
_____ ______ _________ ________ __________ __________ _____ ____.
_____ _________ ______ _________ ______ ___ _____ ___ _____ ____ ______.
____ ________ ________ ______ ________ ________ _______.
_________ ___ _______ ____ __________ __________ ____ ____ ____ ___ __________.
_________ _______ ____ _______ ______ ____ _______ ________ ___ ___.
______ _________ _______ __________ _____ _______.
_____ ___ ______ ___ ________ _______ ____ ______ ___ ____ __________.
______ _____ ______ ________ _____ __________ __________ ____ ________ _____ ___ ________.
_____ ________ ____ _______ _______ __________ ___ __________ __________ ___ _________ _________.
____ _______ _______ _________ ____ _______ _______ _____ __________.
_______ _____ _______.
Get Full Answer on WhatsApp
एक कम्पनी दो प्रकार की चमड़े की बेल्ट बनाती है। बेल्ट A उच्च कोटि की व बेल्ट B निम्न कोटि की है। दोनों बेल्टों A और B पर लाभ क्रमशः ₹ 4 और ₹ 3 प्रति बेल्ट है। A प्रकार की बेल्ट को बनाने में B, प्रकार की बेल्ट को बनाने के समय से दुगुना समय लगता है और यदि सभी बेल्ट केवल B, प्रकार की ही हों, तो कम्पनी प्रतिदिन 1000 बेल्ट बना पाती है। चमड़े की पूर्ति भी प्रतिदिन केवल 800 बेल्टों (दोनों A और B प्रकार की मिलाकर) के लिए ही उपलब्ध है।
A प्रकार की बेल्ट के लिए एक फैन्सी तुकमें (बकल) की आवश्यकता है और प्रतिदिन केवल 400 तुकमें (बकल) ही उपलब्ध हैं। B. प्रकार की बेल्ट के लिए प्रतिदिन 700 तुकमें ही उपलब्ध हैं। प्रत्येक प्रकार की बेल्ट का प्रतिदिन कितना उत्पादन होना चाहिए? इस समस्या को रैखिक प्रोग्रामन (LP) निदर्श में सूत्रित कीजिए और इसे ग्राफीय-विधि द्वारा हल कीजिए।
b) उत्तर-पश्चिम कोना विधि का प्रयोग करके निम्नलिखित परिवहन समस्या का प्रारम्भिक आधारी सुसंगत हल ज्ञात कीजिए :
wo breakfast food manufacturers ABC and XYZ are competing for an increased market share. The pay-off matrix, shown in the following table, describes the increase in market share for ABC and decrease in market share of XYZ. Determine optimal strategies for both the manufacturers and the value of the game.
b) Find all the basic feasible solutions of the following system of linear equations:
$
$
$
Check if any of them is degenerate solution. Justify your answer.
A department has five employees with five jobs to be performed. The time (in hours) each employee will take to perform each job is given in the following matrix. How should the jobs be allocated, one per employee, so as to minimize the total man hours?
b) For the following pay-off matrix, transform the zero-sum game into an equivalent linear programming problem:
Solve the following LPP graphically:
Maximize:
$
subject to the constraints:$
$
$
b) Find all values of k for which the vectors:$
are linearly independent.
) निम्नलिखित दो खिलाड़ी शून्य योग खेल को प्रमुखता सिद्धांत द्वारा खेल में समानीत कीजिए और इस प्रकार खेल को हल कीजिए।
A company makes two kinds of leather belts. Belts A is high quality belt and belt B is of lower quality. The respective profits on A and B are ₹ 4 and ₹ 3 per belt. The production of each type A requires twice as much time as a belt. The production of each type of type B, and if all belts were of type B, the company could make 1000 belts per day. The supply of leather is sufficient for only 800 belts per day (both A
and B combined). Belt A require a fancy buckle and only 400 buckles per day are available. There are only 700 buckles a day available for belt B. What should be the daily production of each type of belt? Formulate this problem as an LP model and solve it by the graphical method.
b) Find the initial basic feasible solution of the following transportation problem using North-West Corner method.
. State which of the following statements are true and which are false. Give reasons for your answer with a short proof or a counter example.
a) The intersection of finite number of convex sets is not convex.
b) If value of the matrix game
is 4, then
.
c) If 10 is added to each of the entries of the cost matrix of a assignment problem, then the total cost of an optimal assignment for the changed cost matrix will increase by 10.
d) For maximization LP model, the simplex method is terminated when all values .
e) The dummy source or destination in a transportation problem is added to prevent solution from becoming degenerate.