Write the LPP formulation of the following assignment problem:
b) Solve the following game graphically:
_____ _________ ____ ___ ______ ______ ___ _____ _______ _____ ______ __________.
_________ _____ _______ _________ ___.
____ __________ __________ ______ ________ _____ _________ __________ ____ _________ _____ ___.
__________ _______ ______ _________ ______ _____.
_________ ______ _______ _________ __________ ________.
_____ ___ _______ _________ _________ _______ _________ __________.
_______ _______ ___ ____ _________ __________ ___ ____.
__________ _________ _______ _________ _____.
_______ ________ ______ _________ ______ __________ _____ _____ ____ _________.
_______ ___ ____ _________ _____ ______ ________ ____ _____.
_________ ________ ___ _________ ____ ____ ______ _______ _______ _____ ____ __________.
__________ ____ ___ _____ ___ _________ ______ _______ _________ ____ _________ __________.
____ _______ ____ _____ _______ ________.
___ _______ ________ _____ __________ _____ ______ _________ __________.
____ _______ _____ ____ ______.
___ __________ ____ _________ ___ _______ ________ ________.
__________ _______ _______ __________ ________ _______ ________ _____.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
✓ Unlock up to 60% of the answer
✓ No payment required
Write the LPP formulation of the following assignment problem:
b) Solve the following game graphically:
बताइए निम्नलिखित कथनों में से कौन-से कथन सत्य हैं और कौन-से असत्य। अपने उत्तर की पुष्टि एक संक्षिप्त उपपत्ति या प्रत्युदाहरण द्वारा कीजिए
a) परिमित संख्या में अवमुख समुच्चयों का सर्वनिष्ठ अवमुख नहीं होता है।
b) यदि आव्यूह खेल
का मान 4 हो, तो
।
c) यदि किसी नियतन समस्या में लागत आव्यूह की प्रत्येक प्रविष्टि में 10 जोड़ा जाए, तो परिवर्तित लागत आव्यूह के लिए इष्टतम नियतन की कुल लागत में 10 की वृद्धि हो जाएगी।
d) किसी अधिकतमीकरण रैखिक प्रोग्रामन (LP) निदर्श में, जब सभी मान हों, तो एकधा विधि सम्पन्न हो जाती है।
e) एक परिवहन समस्या में अपभ्रष्ट हल से बचने के लिए काल्पनिक (dummy) स्रोत या गंतव्य जोड़ा जाता है।
) 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:
$
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:
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:
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.
) For what value of k are the following vectors linearly independent?$
b) Solve the following LP problem using simplex method:
Maximize
Subject to $
$
$