Advertisements
Advertisements
If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and `(0, 7/3)` the maximum value of z = 4x + 5y is ______.
Concept: undefined >> undefined
Choose the correct alternative :
The half plane represented by 3x + 2y ≤ 0 constraints the point.
Concept: undefined >> undefined
Advertisements
Choose the correct alternative :
The half plane represented by 4x + 3y ≥ 14 contains the point
Concept: undefined >> undefined
The optimal value of the objective function is attained at the ______ points of the feasible region.
Concept: undefined >> undefined
Fill in the blank :
“A gorage employs eight men to work in its shownroom and repair shop. The constraints that there must be at least 3 men in showroom and at least 2 men in repair shop are ______ and _______ respectively.
Concept: undefined >> undefined
A train carries at least twice as many first class passengers (y) as second class passengers (x). The constraint is given by ______.
Concept: undefined >> undefined
Fill in the blank :
A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.
Concept: undefined >> undefined
State whether the following is True or False :
Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.
Concept: undefined >> undefined
State whether the following is True or False :
The point (1, 2) is not a vertex of the feasible region bounded by 2x + 3y ≤ 6, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.
Concept: undefined >> undefined
State whether the following is True or False :
The feasible solution of LPP belongs to only quadrant I.
Concept: undefined >> undefined
The Cost of Living Index Number using Weighted Relative Method is given by ______
Concept: undefined >> undefined
The Assignment Problem is solved by ______.
Concept: undefined >> undefined
To use the Hungarian method, a profit maximization assignment problem requires ______.
Concept: undefined >> undefined
Choose the correct alternative :
Using Hungarian method the optimal assignment obtained for the following assignment problem to minimize the total cost is:
| Agent | Job | |||
| A | B | C | D | |
| 1 | 10 | 12 | 15 | 25 |
| 2 | 14 | 11 | 19 | 32 |
| 3 | 18 | 21 | 23 | 29 |
| 4 | 15 | 20 | 26 | 28 |
Concept: undefined >> undefined
Fill in the blank :
For solving an assignment problem the matrix should be a _______ matrix.
Concept: undefined >> undefined
Fill in the blank :
In Hungarian Method, only _______ task can be assigned to each facility.
Concept: undefined >> undefined
State whether the following is True or False :
The Hungarian method operates on the principle of matrix reduction, whereby the cost table is reduced to a set of opportunity costs.
Concept: undefined >> undefined
State whether the following is True or False :
Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a zero.
Concept: undefined >> undefined
State whether the following is True or False :
Using the Hungarian method, the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the no of persons.
Concept: undefined >> undefined
Two numbers are selected at random (without replacement) from the first six positive integers. Let X denote the larger of the two numbers. Find E(X).
Concept: undefined >> undefined
