Time Left - 06:00 mins
AE-JE (ME) II Industrial Engineering Quiz-1
Attempt now to get your rank among 36 students!
Question 1
Maximize Z = 2x + y
x + y ≤ 1000
2x + y ≥ 2000
y ≤ 1000
x, y ≥ 0
the above problem has
Question 2
Consider the following statements:
1). Resources limitations must be known.
2). Relationship of variables must be known.
Which of these statements must be satisfied to deal with the graphical techniques of linear programming effectively?
1). Resources limitations must be known.
2). Relationship of variables must be known.
Which of these statements must be satisfied to deal with the graphical techniques of linear programming effectively?
Question 3
Which of the following is not a part of every linear programming problem formulation?
Question 4
A feasible solution to a linear programming problem-
Question 5
In the solution of linear programming problems by simplex method for deciding the leaving variables , variables corresponding to the:
Question 6
Which of the following is incorrect in context of simplex method?
Question 7
If ‘n’ is the number of variables and ‘m’ is number of constraints, then the compulsory condition for suitability of simplex method is____
Question 8
If at the optimum in a linear programming problem, a dual variable corresponding to a particular primal constraint is zero, then it means that
Question 9
The leaving basic variable in a maximizing simplex method is the basic variable that __________.
Question 10
Simplex method of solving linear programming problem uses ____.
- 36 attempts
- 0 upvotes
- 1 comment
Mar 2AE & JE Exams
