Using matrix – minima method, find the initial basic feasible solution of the following transportation problem:
Hence find the optimal solution.
b) Check whether the following set is convex:
Transportation Problem Costs, supplies, and demands: | | D1 | D2 | D3 | D4 | Supply | | ---------: | -: | -: | -: | -: | -----: | | S1 | 4 | 6 | 8 | 8 | 40 | | S2 | _____ ______ ____ _________ _____ ___ __________ ____.
_________ ____ _______ ___ ___ ________ ________ _______ _________.
_____ ___ __________ _______ ______ ______ ___ __________ ___ __________ _____.
_______ __________ _____ _________ ____ _________ ______ ______ ___ ________.
_______ ________ __________ _______ _________ _______ __________ ______ ______ _____.
____ ______ _____ _______ ___.
_____ __________ __________ ___ _____ ___ ________ ________ _________ __________ _________.
______ _________ ____ _____ ______ _______ ______ _________ ____ ______.
________ _________ ___ ___ _________ _______ __________.
_______ _____ ____ ______ ____ ___ _______ ___ ___ _______ _____.
________ ____ ___ ____ ___ _________ ________.
_________ _______ ____ _______ _____ ______.
____ _________ ______ _________ _____ ________.
__________ ___ ____ _______ ______ ________ ________ ____ _______.
______ _____ _________ ______ _______ ____ __________ ___ _______ _______.
_______ ________ _____ ________ _________ _______ ____ ______ ________ ______ _____.
________ ________ ________ _____ _________ __________ __________ _____ _____ _______ _________ ______.
_______ ________ _____ _____ ____ ____ ______ _____ _________.
_____ _______ _________ _____ _________ _____ ____ ____ ______ __________ __________ _______.
_____ ________ _____ ______ _________ ___ ________ ________ __________.
____ ____ ___ ________ _____ ______ ____ ____ _______ ___ ________ ___.
___ _______ __________ _____ ____ __________ _______ ___ ____ _____ _________ ____.
______ __________ __________ _______ _____ ______ ______.
_________ ______ _____ _____ __________ _______ ____ ___ ________.
_______ ______ _____ ___ _______ ________ ___ ______ ________ _________ __________ ____.
_______ ________ _________ ___ _________.
Get Full Answer on WhatsApp
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.
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:
Reduce the following two person zero sum game to game using principle of dominance. And hence solve the game.
Player B
b) Obtain the dual of the following primal LP problem:
Maximize
Subject to $
$
बताइए निम्नलिखित कथनों में से कौन-से कथन सत्य हैं और कौन-से असत्य। अपने उत्तर की पुष्टि एक संक्षिप्त उपपत्ति या प्रत्युदाहरण द्वारा कीजिए
a) परिमित संख्या में अवमुख समुच्चयों का सर्वनिष्ठ अवमुख नहीं होता है।
b) यदि आव्यूह खेल
का मान 4 हो, तो
।
c) यदि किसी नियतन समस्या में लागत आव्यूह की प्रत्येक प्रविष्टि में 10 जोड़ा जाए, तो परिवर्तित लागत आव्यूह के लिए इष्टतम नियतन की कुल लागत में 10 की वृद्धि हो जाएगी।
d) किसी अधिकतमीकरण रैखिक प्रोग्रामन (LP) निदर्श में, जब सभी मान हों, तो एकधा विधि सम्पन्न हो जाती है।
e) एक परिवहन समस्या में अपभ्रष्ट हल से बचने के लिए काल्पनिक (dummy) स्रोत या गंतव्य जोड़ा जाता है।
Solve the following LPP graphically:
Maximize:
$
subject to the constraints:$
$
$
b) Find all values of k for which the vectors:$
are linearly independent.
) Using matrix – minima method, find the initial basic feasible solution of the following transportation problem:
Hence find the optimal solution.
b) Check whether the following set is convex:
$
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 |
