Objective Questions on Operation Research

Shivaji University Kolhapur M.Sc Semester-III Computer Science Paper March 2019

In standrd form of LPP ______
(a) The decision variables are unrestricted in sign
(b) The constraints are strict equations
(c) The constraints are inequality
(d) None of these

The transportation problem is balanced if ______
(a) Total demand is equal to total supply irrespective of the number of sources and destination
(b) Total demand is equal to total supply and of the number of sources and destination are equal
(c) number of sources and destination are equal
(d) None of these

Given a system of m simultaneous linear equations in n unknown (m<n), the number of basic variable will be _____
(a) n
(b) n-m
(c) n+m
(d) m

The initial solution of a TP obtained by _______
(a) North-west corner method
(b) MODI method
(c) Hungarian method
(d) All of these

If two constraints are not intersecting in the positive quadrant of the graph then ____
(a) one of the constraint is redundant
(b) the solution is unbounded
(c) the solution is feasible
(d) None of these

The assignment problem is a special case of transportation problem in which number of origins _____
(a) Is less than or equal to the number of destinations
(b) Is greater than the number of destinations
(c) Equals the number of destination
(d) Is less than the number of destinations

Network problems have advantages in terms of project ______
(a) Scheduling
(b) Planning
(c) Controlling
(d) All of these

In critical path analysis, CPM is ______
(a) Event oriented
(b) Probabilistic
(c) Deterministic in nature
(d) Dynamic in nature

In assignment problem involving 4 workers and 3 jobs, total number of assignment possible are _____
(a) 4
(b) 3
(c) 7
(d) 12

A simplex in two dimension is _______
(a) Line
(b) Triangle
(c) Point
(d) None of these

The boundary points of convex set are always ________
(a) Not extreme points
(b) Interior points
(c) Extreme Points
(d) None of these

While finding dual of any primal form, all constraints must be in ______
(a) Less than or equal to
(b) Greater than or equal to
(c) equal to
(d) Any of these

The set C containing only single point is ______
(a) Concave
(b) Convex
(c) Convex hull
(d) Convex polyhedron

Dual simplex method is applicable to those LPPs that start with ______
(a) An infeasible solution
(b) An infeasible but optimal solution
(c) A feasible solution
(d) A feasible and optimal solution