Operations Research

Max. Marks - 60

Max Time: - 2 hrs.

The question paper contains three sections .All the questions are compulsory.
Sections - A
Q1.

( 1 x 15 = 15 )

Operations research approach is:(a) Multi - disciplinary

(b) Scientific
(c) Institutive
(d) All of the above
Q2. Decision variables are:(a) Controllable
(b) Uncontrollable
(c) Parameters
(d) None of the above
Q3. The best use of linear programming technique is to find an optimal use of:(a) Money
(b) Manpower
(c) Machine
(d) All of the above
Q4. While solving a LP model graphically, the area bounded by the constraints is called:(a) Feasible region
(b) Infeasible region
(c) Unbounded solution
(d) None of the above
Q5. For a maximization problem, the objective function coefficient for an artificial variable is:(a) +M
(b) -M
(c) Zero
(d) None of the above
Q6. In the optimal simplex table Cj - Zj=0 value indicates:(a) Unbounded Solution
(b) Cycling
(c) Alternative Solution
(d) Infeasible Solution
Q7. For maximization LP Model, the simplex method is terminated when all values:(a) Cj - Zj 0
(b) Cj - Zj 0
(c) Cj-Zj =0
(d) Zj 0
Q8. If an artificial variable is present in the basic variable column of optimal simplex table then the
solution is:(a) Unbounded
(b) Infeasible
(c) Optimal
(d) None of the above
Q9. The graphical method of LP problem uses:(a) Objective function equation
(b) Constraint Equation
(c) Linear Equation
(d) All of the above
Q10. If a non-redundant constraint is removed from a LP problem, then:(a) Feasible region will become larger
(b) Feasible region will become smaller
(c) Solution will become infeasible
(d) None of these
Q11. Linear Programming is a:(a) Constrained optimization technique
(b) Technique for economic allocation of limited
resources
(c) Mathematical Techniques
(d) All of the above
Q12. Which of the following is not a characteristic of LP model:(a) Alternative courses of action
(b) An objective function of minimization type
(c) Limited amount of resources
(d) Non-negativity condition on the value of
decision variables
Q13. Managerial decisions are based on:(a) An evaluation of quantities data
(b) The use of qualitative factors
(c) Numbers produced by formal models
(d) All of the above
Constrconstraints
Q14.
in an LP model represents:(a) Limitations
(b) Requirements
(c) Balancing limitations and requirements (d) All of the above
Q15. Which of the following is the assumption of an LP model

(a) Divisibility
(c) Additively

(b)
(d)

Proportionality
All of the above

Section - B

(12.5 2 =25)

Attempt any two parts in question 3 and 4 of this section.

Q2. (a) Define Operations Research and discuss its scope.
(b) Solve the following LPP by Graphical method.

Q3.

Max. Z = 5 X1+ 3X2

S.t.
X1 + X2 2
5X1 + 2X2 10
3X1 + 8X2 12
X1, X2 0
(c) Find the dual of the following LPP
Min. Z = 2X2 + 5 X3
S.t.
X1 + X2 2
2X1+ X2 + 6 X3 6
X1 - X2 + 3 X3 = 4
X1, X2, X3 0
(a) What are the components of a linear programming problem? What do you
mean by non-negativity restrictions?
(b) A firm manufactures two type of products A and B and sells them at a
profit of Rs. 2 on type A and Rs. 3 on type B. Each product is processed
on two machines G and H. Type A requires one minute of
processing time
on G and two minutes on H; type B requires one
minute on G and one
minute on H. The machine G is available for
not more than 6 hrs. 40
minutes while machine H is
available for 10 hrs. during any working day.
Formulate the
problem as a linear programming problem.
(c) Solve the following by graphical method.
Maximize Z = - X1 +2 X2
S.t.
- X1 + X2 1
- X1 +2 X2 4
X1, X2 0
Section - C
Q4.Solve the following LPP by simplex method.
Maximize Z = 3 X1 + 5 X2
S.T.
3 X1 + 2 X2 18
X1 4
X2 6
X1, X2 0
OR
Use Big-M method to solve the following.
Maximize Z = 2 X1 + X2 + 3 X3
S.T.
X1 + X2 + 2 X3 5
.
X1 - X2 + 3 X3 = 4
X1, X2 , X3 0

(20 1 =20)