# Graphical method, simplex method and transportation method are concerned with

1.  Value analysis

2.  Linear programming

3.  Break-even analysis

4.  Queuing theory

4

Linear programming

Explanation :
No Explanation available for this question

# In simplex method of linear programming, the objective row of the matrix consist of

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

4

Coefficient of the objective function, which is the profit contribution per unit of each of the products

Explanation :
No Explanation available for this question

# In linear programming, shadow prices are

1.  Cost of brought out items

2.  Maximum cost per item

3.  Value assigned to one unit of capacity

4.  Lowest sale prices

4

Value assigned to one unit of capacity

Explanation :
No Explanation available for this question

# In simplex method, if all the basic variable are greater than zero (>0), the solution is called

1.  Non-degenerate

2.  Degenerate

3.  Basic solution

4.  None of these

4

Non-degenerate

Explanation :
No Explanation available for this question

# In linear programming

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

4

All of these

Explanation :
No Explanation available for this question

# A linear programming problem is called so, because in that problem

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

4

Both (a) and (b)

Explanation :
No Explanation available for this question

# In the graphical method of linear programming problem, every corner of the feasible polygon indicates

1.  A basic feasible solution

2.  Optimum solution

3.  Both (a) and (b)

4.   None of these

4

A basic feasible solution

Explanation :
No Explanation available for this question

# In the graphical method of linear programming problem, the optimum solution would lie in the feasible polygon at

1.  It’s one corner

2.  It’s centre

3.  Middle of any side

4.   None of these

4

It’s one corner

Explanation :
No Explanation available for this question

# In the simplex method, the variables which have not been assigned the value zero, during an iteration, are called

1.  Basic variable

2.  Artificial variable

3.  Actual variable

4.   None of these

4

Basic variable

Explanation :
No Explanation available for this question

# In the simplex method, the unbounded solution is indicated when

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

4