Description

This mock test of Test: Linear Programming (Level - 1) for Mechanical Engineering helps you for every Mechanical Engineering entrance exam.
This contains 20 Multiple Choice Questions for Mechanical Engineering Test: Linear Programming (Level - 1) (mcq) to study with solutions a complete question bank.
The solved questions answers in this Test: Linear Programming (Level - 1) quiz give you a good mix of easy questions and tough questions. Mechanical Engineering
students definitely take this Test: Linear Programming (Level - 1) exercise for a better result in the exam. You can find other Test: Linear Programming (Level - 1) extra questions,
long questions & short questions for Mechanical Engineering on EduRev as well by searching above.

QUESTION: 1

The mathematical technique for finding the best use of limited resources in an optimum manner is known as

Solution:

QUESTION: 2

In case of solution of linear programming problem using graphical method, if the constraint line of one of the non-redundant constraints is parallel to the objective function line, then it indicates

Solution:

QUESTION: 3

In an LPP if one of the decision variable is zero then the solution is

Solution:

QUESTION: 4

Which of the following is a correct expression for an objective function in an LPP?

Solution:

QUESTION: 5

In the solution of a linear programming problem by Simplex method, if during iteration, all ratios of right-hand side bi to the coefficients of entering variable a are found to be negative, it implies that the problem has

Solution:

QUESTION: 6

The simplex method is the basic method for

Solution:

QUESTION: 7

Which one of the following is true in case of simplex method of linear programming?

Iterative solution: The steps keep on repeating until we get an optimal solution.

Solution:

QUESTION: 8

A feasible solution to the linear programming problem should

A feasible solution to the linear programming problem should satisfy the problem constraints

Solution:

QUESTION: 9

A tie for leaving variables in simplex procedure implies

Solution:

QUESTION: 10

On solving an LPP using simplex method, the optimality is reached for a maximization problem when

Solution:

QUESTION: 11

Linear programming can be used to solve

Solution:

QUESTION: 12

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

Solution:

QUESTION: 13

Which one of the following is not the solution method of transportation problems?

Solution:
Hungarian method is used in assignment problem (but remember assignment problem is a special case of transportation problem).

QUESTION: 14

Which one of the following conditions should be satisfied for the application of optimality test on an initial solution of transportation model?

Solution:

QUESTION: 15

Consider the following statements: In a transportation problem, North-West corner method would yield

1. An optimum solution

2. An initial feasible solution

3. Vogel’s approximate solution

Of these statements

Solution:

QUESTION: 16

The Hungarian algorithm for solving an assignment problem requires a

Solution:

QUESTION: 17

The solution in a transportation model (of dimension m × n) is said to be degenerate if it has

Solution:

QUESTION: 18

Which one of the following is the correct statement? In the standard form of a linear programming problem, all constraints are

Solution:

QUESTION: 19

The number of basic variables in a simplex method is equal to

Solution:

QUESTION: 20

The primal of a LP problem is maximization of objective function with 6 variables and 2 constraints. Which of the following correspond to the dual of the problem stated?

1. It has 2 variables and 6 constraints

2. It has 6 variables and 2 constraints

3. Maximization of objective function

4. Minimization of objective function

Select the correct answer using the codes given below

Solution:

### Solution- Linear Programming Test-1

Doc | 3 Pages

### Linear Programming (Part - 1)

Doc | 8 Pages

### Linear Programming

Video | 33:20 min

### Linear Programming

Doc | 13 Pages

- Test: Linear Programming (Level - 1)
Test | 20 questions | 25 min

- Test: Linear Programming (CBSE Level) - 1
Test | 25 questions | 25 min

- Test: Linear Programming (Level - 2)
Test | 20 questions | 45 min

- Test: Linear Programming (Level - 3)
Test | 14 questions | 45 min

- Linear Programming - 1
Test | 10 questions | 30 min