21. | A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. |
a. | degenerate |
b. | non-degenerate |
c. | unbounded |
d. | unbalanced |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (a).degenerate
|
22. | The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is
![]() |
a. | 76 |
b. | 80 |
c. | 90 |
d. | 96 |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (b).80
|
23. | A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. |
a. | Support |
b. | α-cut |
c. | Convex |
d. | Concave |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (c).Convex
|
24. | If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} Then the value of μ(A∪B)’(x) will be |
a. | {0.9, 0.5, 0.6, 0.8, 0.8} |
b. | {0.6, 0.2, 0.1, 0.7, 0.5} |
c. | {0.1, 0.5, 0.4, 0.2, 0.2} |
d. | {0.1, 0.5, 0.4, 0.2, 0.3} |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (c).{0.1, 0.5, 0.4, 0.2, 0.2}
|
25. | Consider a single perception with weights as given in the following figure. The perception can solve
![]() |
a. | OR problem |
b. | AND problem |
c. | XOR problem |
d. | All of the above |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (b).AND problem
|