Question
. 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.
Answer :
Word Count : 229
__________ _________ ___ ____ _________.
___ _____ _______ ____ _______ _________.
_________ _________ ________ _________ _____ ________ __________ ________ ________ __________.
_______ __________ _________ ______ _________ _______ ________ ____ ___ _____.
_____ ____ ____ _________ __________ ___ ___.
______ ____ _______ _________ _______.
_____ ____ ____ __________ ____ ___ _________ __________ _________ ________.
__________ _____ ________ ____ _________.
__________ _______ _____ ______ ____ _____ ________ __________.
____ ____ __________ __________ _________ ___ _____.
______ __________ ___ __________ ______ _______ __________ _________ ____ ____ ______.
____ _______ _____ ________ ____ ____ _________ __________ ________ ______.
_______ ______ ____ _______ ____ _______.
_____ ___ ___ __________ _______ _________ ____ __________ _________ _________ __________ ________.
_________ ____ _____ ____ _________ _____ ________ ________ ______ __________.
_________ __________ _________ ___ ___ ________ _______ ________ _____ ________.
______ ________ ______ ______ _________ __________ ______ _______ __________.
________ _________ ______ _______ ____ ___ _______ _______ ____ ___.
___ __________ ___ ________ _______ _____.
Skip in 10
a) False. The intersection of a finite number of convex sets is always convex. Reason: Let (C_1, C_2, \dots, C_n) be convex sets. For any (x, y \in \bigcap_{i=1}^n C_i), since each (C_i) is convex, (\lambda x + (1-\lambda)y \in C_i) for all (\lambda \in [0,1]). Therefore, (\lambda x + (1-\lambda)y \in \bigcap_{i=1}^n C_i). b) False. Consider the matrix [
_________ __________ ______ __________ _____ ___ __________ _________ __________ ____ _________ ______.__________ _________ ___ ____ _________.
___ _____ _______ ____ _______ _________.
_________ _________ ________ _________ _____ ________ __________ ________ ________ __________.
_______ __________ _________ ______ _________ _______ ________ ____ ___ _____.
_____ ____ ____ _________ __________ ___ ___.
______ ____ _______ _________ _______.
_____ ____ ____ __________ ____ ___ _________ __________ _________ ________.
__________ _____ ________ ____ _________.
__________ _______ _____ ______ ____ _____ ________ __________.
____ ____ __________ __________ _________ ___ _____.
______ __________ ___ __________ ______ _______ __________ _________ ____ ____ ______.
____ _______ _____ ________ ____ ____ _________ __________ ________ ______.
_______ ______ ____ _______ ____ _______.
_____ ___ ___ __________ _______ _________ ____ __________ _________ _________ __________ ________.
_________ ____ _____ ____ _________ _____ ________ ________ ______ __________.
_________ __________ _________ ___ ___ ________ _______ ________ _____ ________.
______ ________ ______ ______ _________ __________ ______ _______ __________.
________ _________ ______ _______ ____ ___ _______ _______ ____ ___.
___ __________ ___ ________ _______ _____.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.