Timestamp Score REGISTER NUMBER NAME OF THE STUDEN

4/21/2021 17:13:12 11 / 20 18109050 NADIM IJAS KV

4/21/2021 17:16:19 11 / 20 18109603 Javith akthar N
4/21/2021 17:17:23 19 / 20 18109081 Sridhar R
4/21/2021 17:20:25 20 / 20 18109048 muhammed muflih p
4/21/2021 17:34:40 19 / 20 18109063 R sabarinathan
4/21/2021 17:40:45 8 / 20 1810931 hariharan s
4/21/2021 17:46:55 20 / 20 18109805 JOTHI PRAVEEN. V
4/21/2021 17:59:58 4 / 20 18109027 GUNASEKARAN
4/21/2021 20:30:38 19 / 20 18109043 MIKE A FLEMING
4/21/2021 21:07:28 8 / 20 18109037 Karthikesan k
CLASS & SECTION Operations Research emph
Which theory concerns ma
Allocation Models are
MCTB Team Approach Decision Theory None of the above
3 rd year A section Team Approach Decision Theory Symbolic Models
MCT-B 3rd year Team Approach Network Analysis Symbolic Models
mct b Team Approach Decision Theory Symbolic Models
Mechatronics B Team Approach Decision Theory Symbolic Models
mct A Team Approach Decision Theory None of the above
3rd year / MCT-B Team Approach Decision Theory Symbolic Models
3nd & mct -A System Approach Game Theory Symbolic Models
III YR MCT A Team Approach Decision Theory Symbolic Models
MCT A System Approach Decision Theory None of the above
In simplex method , we add
The quantitative approach
What has always been ver
What is being considered
Artificial Variable Scientific approach Decision – making Linear Programming
Artificial Variable Scientific approach Production Computer Programming
Artificial Variable Scientific approach Decision – making Linear Programming
Artificial Variable Scientific approach Decision – making Linear Programming
Artificial Variable Scientific approach Decision – making Linear Programming
Artificial Variable Rational approach Linear Programming Linear Programming
Artificial Variable Scientific approach Decision – making Linear Programming
Surplus Variable All of the above Linear Programming Computer Programming
Artificial Variable Scientific approach Decision – making Linear Programming
Artificial Variable Scientific approach Production Computer Programming
Which method is an iteratAll the constraints are e An optimum solution is con
The solution of any tran
Simplex method Canonical form Best Two
Simplex method Canonical form Ineffective Four
Simplex algorithm Canonical variable Ineffective Two
Simplex algorithm Canonical variable Ineffective Two
Simplex algorithm Canonical variable Ineffective Two
Simplex method Both A and B Ineffective Three
Simplex algorithm Canonical variable Ineffective Two
Slack variable Canonical solution Best Three
Simplex algorithm Canonical variable Ineffective Two
M method Canonical variable Ineffective Five
A feasible solution is cal If demand is lesser than What is the objective fu The distinguished featur
m+n‐1 Balanced problem A set of non-negativity c Relationship among all va
m+n‐1 Balanced problem A linear function in an o All of the above
m+n‐1 Balanced problem A constraint for availabl Value of decision variabl
m+n‐1 Balanced problem A constraint for availabl Value of decision variabl
m+n‐1 Balanced problem A constraint for availabl Value of decision variabl
m+n‐1 Balanced problem A linear function in an o Relationship among all va
m+n‐1 Balanced problem A constraint for availabl Value of decision variabl
m‐n+1 Transportation problem An objective for resear Value of decision variabl
m+n‐1 Balanced problem A constraint for availabl Value of decision variabl
None of the above Balanced problem A set of non-negativity c Relationship among all va
Which one of the followi Branch and bound is a Which data structure is Which of the following br
Strategies sorting algorithm stack Highest cost branch and
Probabilities problem solving techniqustack LIFO branch and bound
Probabilities problem solving techniqustack FIFO branch and bound
Probabilities problem solving techniqustack FIFO branch and bound
Probabilities problem solving techniqustack FIFO branch and bound
Strategies sorting algorithm array FIFO branch and bound
Probabilities problem solving techniqustack FIFO branch and bound
Players sorting algorithm linked list FIFO branch and bound
Probabilities type of tree stack FIFO branch and bound
Probabilities problem solving techniquarray LIFO branch and bound
Which of the following can traverse the state space tree only in DFS manner
backtracking
greedy algorithm
backtracking
backtracking
greedy algorithm
greedy algorithm
backtracking
backtracking
backtracking
dynamic programming