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