| A. | JPEG |
| B. | MPEG |
| C. | FFT |
| D. | Arithmetic coding |
|
Option: D Explanation : Click on Discuss to view users comments. |
| A. | Combination of blur identification and image restoration |
| B. | Combination of segmentation and classification |
| C. | Combination of blur and non-blur image |
| D. | None of the above |
|
Option: A Explanation : Click on Discuss to view users comments. |
A basic feasible solution of a linear programming problem is said to be ............... if at least one of the basic variable is zero.
| A. | degenerate |
| B. | non-degenerate |
| C. | infeasible |
| D. | unbounded |
|
Option: A Explanation : Click on Discuss to view users comments. |
Consider the following conditions :
(a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b) The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies :
| A. | (a) and (b) only |
| B. | (a) and (c) only |
| C. | (b) and (c) only |
| D. | (a), (b) and (c) |
|
Option: D Explanation : Click on Discuss to view users comments. |
Consider the following transportation problem :
The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is :
| FACTORIES | STORES | ||||||
| I. | II. | III. | IV. | Supply | |||
| A | 4 | 6 | 8 | 13 | 50 | ||
| B | 13 | 11 | 10 | 8 | 70 | ||
| C | 14 | 4 | 10 | 13 | 30 | ||
| D | 9 | 11 | 13 | 8 | 50 | ||
| Demand | 25 | 35 | 105 | 20 | |||
| A. | 1450 |
| B. | 1465 |
| C. | 1480 |
| D. | 1520 |
|
Option: B Explanation : Click on Discuss to view users comments. |
