Mechanical Engineering - Industrial Engineering - Linear Programming

Buy GATE - Mechanical Engineering Practice test pack

Question - 1

In order the linear programming techniques provide valid results, then the

  • A relation between factors must be linear (positive)
  • B relation between factors must be linear (negative)
  • C results do not depend upon relation between factors
  • D Both (a) and (b)

Question - 2

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

  • A optimum solution
  • B a basic feasible solution
  • C Both (a) and (b)
  • D None of the above

Question - 3

In simplex method of linear programming, the objective row of the matrix consists of

  • A slack variables
  • B coefficient of the objective function, which is the profit contribution per unit of each of the products
  • C names of the variables of the problem
  • D None of the above

Question - 4

Which of the following is not correct about LPP?

  • A All constraints must be linear relationships
  • B Objective functions must be linear
  • C All the constraints and decision variables must be of either \(\le\) or \(\ge\) type
  • D All decision variables must be non-negative

Question - 5

In the simplex method, infeasibility of a linear programming problem is indicated, when

  • A values of the index row, (cj - zj) under one or more of the non-base decision variables is/are zero
  • B value of index row, (cj - zj) indicate optimality with artificial variable in the base
  • C some of the values in constant column (bi) are zero
  • D all the replacement ratios, \({b_i\over a_{is}}\) (s is key column) are a negative

Question - 6

In the simplex method, the unbounded solution is indicated when

  • A value of index row (cj - zj), under one or more of the non-base decision variables is/are zero
  • B all the replacement ratios, \(({b_i\over a_{is}})\) (s indicates key column) are negative
  • C value of index row (Cj - Zj) indicate optimality with artificial variable in the base
  • D some of all values in the constant column (bi) are zero

Question - 7

In the simplex method, the existence of more than one optimum solution is indicated, when

  • A the index row (cj - Zj) under one or more of the non-base decision vanables is/are zero
  • B all the replacement ratios, \(({b_i\over a_{is}})\) (s indicates key column) are negative
  • C some of the values in constant column (bi) are zero
  • D All of the above

Question - 8

Dual of dual is

  • A primal
  • B dual
  • C either dual or primal
  • D None of these

Question - 9

The dual of the primal maximization LPP having m constraints and n non-negative variables should

  • A be a minimization LPP
  • B have n constraints and m non-negative variables
  • C Both (a) and (b)
  • D None of the above

Question - 10

If dual has an unbounded solution, primal has

  • A an unbounded solution
  • B an infeasible solution
  • C a feasible solution
  • D None of these
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next
Previous Next