S4 B.

Com Possible Questions with answers

MA3608 – Elements of Operations Research
1. Define a feasible region of LPP.
Soln:
A region in which all the constraints as well as non negative restrictions are satisfied
simultaneously is called a feasible region.
2. Define a feasible solution of LPP.
Soln:
Any solution to a LPP which satisfies the non-negativity restrictions of the LPP is called
feasible solution.
3. State the limitation of graphical method in solving LPP
Soln:
LPP with only two variables can be solved by this method
4. Define unbounded solution in LPP.
Soln:
If the value of the objective function Z increased or decreased indefinitely then the solution is
called unbounded solution.
5. What is meant by slack variables in LPP?
Soln:
The non-negative variable which is added to the LHS of the constraint to convert the
n
∑ aij x i +s i=bi
inequality ‘’ into an equation is called slack variables. j=1 ,
i = 1,2,….,m. where si are called surplus variables.
6. How many basic feasible variables are there to a given system of 4 simultaneous equations in 5
unknowns?
Soln:
There are 5C 4 basic feasible variables to a given system of 4 simultaneous equations in 5
unknowns.
7. Define artificial variable in LPP.
Soln:
Any non-negative variable which is introduced in the constraint in order to get the intial basic
feasible solution is called artificial variable.
8. When does an LPP possess a pseudo-optimal solution?
Soln:
An LPP possesses a pseudo-optimal solution if at least one artificial variable in the basis at
positive level even though the optimality conditions are satisfied.
9. What is meant by degeneracyof LPP?
Soln:
The concept of obtaining a degenerate basic feasible solution in a LPP is called degeneracy.
10. What are the limitations of LPP?
Soln:
1. For larger problems having many variables and constraints, the computational difficulties are
enormous even when computers are used.
2.Many times it is not possible to express both the objective function and constraints in linear form.
 3.The solution variables may have any values. Sometimes the solution variables
are restricted to take only integer values.
11. State the characteristics of standard form and write the standard form of the LPP in
matrix form.
Soln:
Characteristics of Standard form.
(i)The objective function is of maximization type.
(ii)All constraints are expressed as equations.
(iii)RHS of each constraint is non-negative.
(iv)All variables are non-negative.
Matrix form
Max Z = CX
Subject to AX = b, X  0.
12. State the characteristics of canonical form and write the canonical form of the LPP in matrix form.
Soln:
Characteristics of Canonical form.
(i)The objective function is of maximization type.
(ii)All constraints are  type.
(iii)RHS of each constraint is non-negative.
(iv)All variables are non-negative.
Matrix form
Max Z = CX
Subject to AX  b, X  0.
13. What is the difference between the feasible and basic feasible solution?
Soln:
The solution of m basic variables when each of the (n – m) non-basic variable is set to zero is
called basic variable solution.
A basic feasible solution in which all the basic variables 0 is called a basic feasible solution.
14. Write the general mathematical model of LPP in matrix form.
Soln:
Max or Min Z = CX
Subject to AX (¿ = ≥ ) b and X¿ 0
15. What are the methods used to solve the LPP involving artificial variables?
Soln:

Big M method (Penalty method) (ii) Two-phase method.

PART: B
1. Solve the following LPP by graphical method
Max Z = 3 x 1 +2 x 2
Subject to
−2 x 1 +x 2≤1
x 1≤2
x 1 +x 2 ≥3
and x 1 , x 2 ≥0
2. Solve the following LPP by graphical method
Max Z = 3 x 1+ 4 x 2
Subject to
5 x 1 +4 x2 ≤200
3 x 1 +5 x 2≤150
5 x 1 +4 x2 ≥100
8 x 1 +4 x 2≥80
and x 1 , x2 ≥0

3. Solve the following LPP by graphical method.

Minimize Z = 3 x 1 +5 x 2
Subject to
−3 x 1 +4 x 2≤12
x 1≤4
2 x1 −x 2 ≥−2
x 2≥2
2 x1 +3 x2 ≥12
¿ x 1 , x 2 ≥0
4. Use simplex method to solve the following L.P.P
Max Z = x1 + x2+3x3
Subject to the constraints:
3x1+ 2x2+ x3£3
2x1 + x2+ 2x3£ 2
& x1 , x2³ 0
5. Solve the following LPP using simplex method
Min Z = 1
8 x −2 x 2
Subject to
−4 x 1 +2 x 2 ≤1
5 x 1−4 x 2≤3
¿ x 1 , x 2 ≥0

6. Use big M method to solve the LPP

Maximize Z = 3 x 1 +2 x2
Subject to
2 x1 +x 2≤2
3 x 1 +4 x2 ≥12
¿ x 1 , x2 ≥0