1. Value analysis
2. Linear programming
3. Break-even analysis
4. Queuing theory
Linear programming
1. Names of the variables of the problems
2. Coefficient of the objective function, which is the profit contribution per unit of each of the products
3. Slack variables
4. None of these
Coefficient of the objective function, which is the profit contribution per unit of each of the products
1. Cost of brought out items
2. Maximum cost per item
3. Value assigned to one unit of capacity
4. Lowest sale prices
Value assigned to one unit of capacity
1. Non-degenerate
2. Degenerate
3. Basic solution
4. None of these
Non-degenerate
1. It is applicable to linear models only
2. Uncertainties in the future cannot conveniently be incorporated in model
3. No solution is available to time spans shorter than periods in model
4. All of these
All of these
1. All the functions expressing the constraints are linear
2. Objective function also should be linear
3. Both (a) and (b)
4. None of these
Both (a) and (b)
1. A basic feasible solution
2. Optimum solution
3. Both (a) and (b)
4. None of these
A basic feasible solution
1. It’s one corner
2. It’s centre
3. Middle of any side
4. None of these
It’s one corner
1. Basic variable
2. Artificial variable
3. Actual variable
4. None of these
Basic variable
1. Values of index row, cj – zj, under one or more of the non-base decision variables ,is/are zero
2. Some of the values in the constant column, bi are zero
3. All the replacement ratios, (bi/ais), (‘s’ indicates key column) are negative
4. Values of index row cj – zj indicate optimality with artificial variable in the base
All the replacement ratios, (bi/ais), (‘s’ indicates key column) are negative