info@avatto.com
+91-9920808017
66. For any binary (n, h) linear code with minimum distance (2t+1) or greater
2t+1
t+1
t
t-1
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
67. Which of the following is a valid reason for causing degeneracy in a transportation problem? Here m is no. of rows and n is no. of columns in transportation table.
When the number of allocations is m+n−1
When two or more occupied cells become unoccupied simultaneously.
When the number of allocations is less than m+n−1
When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop.
68. Consider the following LPP : Max Z = 15x1 + 10x2 Subject to the constraints 4x1 + 6x2 ≤ 360 3x1 + 0x2 ≤ 180 0x1 + 5x2 ≤ 200 x1, x2 / 0The solution of the LPP using Graphical solution technique is :
x1=60, x2=0 and Z=900
x1=60, x2=20 and Z=1100
x1=60, x2=30 and Z=1200
x1=50, x2=40 and Z=1150
69. Consider the following LPP : Min Z = 2x1 + x2 + 3x3 Subject to : x1 − 2x2 + x3 ≥ 4 2x1 + x2 + x3 ≤ 8 x1 − x3 ≥ 0 x1, x2, x3 ≥ 0 The solution of this LPP using Dual Simplex Method is :
x1=0, x2=0, x3=3 and Z=9
x1=0, x2=6, x2=0 and Z=6
x1=4, x2=0, x2=0 and Z=8
x1=2, x2=0, x2=2 and Z=10
70. Consider a Takagi - Sugeno - Kang (TSK) Model consisting rules of the form: If Xi is Ai1 and... and xr is Air THEN y = fi(x1, x2,.... xr) = bi0 + bi1x1 + birxr assume, ai is the matching degree of rule i, then the total output of the model is given by:
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
