Q.1 Consider a small manufacturer making two products ‘A’ and ‘B’.

Two
resources R1 and R2 are required to make these products. Each unit of
product ‘A’ requires 1 unit of resource R1 and 3 units of R2 . Each unit of
product ‘B’ requires 1 unit of resource R1 and 2 units of resource R2. The
manufacturer has 5 units of R1 and 12 units of R2 available.
The manufacturer makes a profit of Rs 6/unit of product ‘A’ sold and Rs
5/unit of product ‘B’ sold. In order to calculate number of ‘A’ and ‘B’ to
be manufactured in order to have maximum profit formulate the LPP.
Q.2 A firm produces 3 products; these products are processed on 3 different
machines. The time required to manufacture one unit of each type and
daily capacity of 3 machines are given below in the table.
The profit per unit for product 1 is Rs 4/-, for product 2 is Rs 3/- and for
product 3 is Rs 6/-. Formulate the LPP to maximize the profit.

Machines Manufacturing time Daily capacity

per unit (min) (min)
P1 P2 P3
M1 2 3 2 400
M2 4 - 3 470
M3 2 5 - 430
Q.3 Solve the LPP and find the optimal feasible solution
Zmin = 20 X1 + 10 X2
Subjected to X1 + 2 X2 ≤ 40
3X1 + X2 ≥30
4X1 + 3X2 ≥ 60
X1, X2 ≥ 0
Q.4 Solve the LPP and find the optimal feasible solution
Zmax = 100 X1 + 40 X2
Subjected to 5X1 + 2 X2 ≤ 1000
3X1 + 2X2 ≤ 900
X1 + 2X2 ≤ 500
X1, X2 ≥ 0
Q.5 Solve the LPP and find the optimal feasible solution
Zmax = 3 X1 + 2 X2
Subjected to X1 - X2 ≥ 1
X1 + X 2 ≥ 3
X1, X2 ≥ 0
Q.6 Maximize Z = 15 X1 + 20 X2
Subjected to 12X1 + 4X2 ≥ 36
12X1 - 6X2 ≤ 24
X 1, X 2 ≥ 0
The above linear programming problem has
(A) Infeasible solution
(B) Unbounded solution
(C) Alternative optimal solution
(D) Redundant constraint
Q.7 A company is manufacturing two different products A and B. Each
product is to be processed in three departments- Casting, Machining and
finally inspection. The capacity of 3 departments is limited to 35 hours,
32 hours and 24 hours per week respectively. Product A requires 7 hours
in casting department, 8 hours in machining shop and 4 hours in
inspection whereas product B requires 5 hours, 4 hours and 6 hours
respectively in respective shops. The profit contribution for a unit
product of A and B is Rs 30/- and Rs 40/- respectively.
(1) Formulate the problem
(2) Find out the optimal solution.
Q.8 A firm uses a turning centre, a milling centre and a grinding machine to
produce two parts. The table below provides the machining time required
for each part and the maximum machining time available on each
machine. The profit per unit on Part I and II are Rs 40/- and Rs 100/-
respectively. The maximum profit per week of the firm is Rs_ _ _?

Machining time required for Max Machining time

Type of
the machine part (min) available per week
machine
I II (min)
Turning 12 6 6000
Centre
Milling 4 10 4000
Centre
Grinding 2 3 1800
Centre
Q.9 A company manufactures two products A and B. The manufacturing and
marketing data for the two products is given below:

Departments Product A Product B Capacity

Welding 2.0 man-hr 2.5 man-hr 1000 man-hr
Machines 3.0 man-hr 1.5 man-hr 1200 man-hr
Assembly 1.5 man-hr 4.0 man-hr 1200 man-hr
Profit Rs 120 Rs 100

(1) Formulate the problem

(2) Find the product mix that will maximize the profit.
Q.10 Solve the following LPP problem graphically and identify redundant
constraint.
Maximize Z = 4 X1 + 10 X2
Subjected to 2X1 + X2 ≤50
2X1 + 5X2 ≤ 50
2X1 + 3X2 ≤ 50
X 1, X 2 ≥ 0
Q.11 Shadow Price:

Common Data Question: One unit of product P1 requires 3 keg of

resource R1 and 1 kg of resource R2. One unit of product P2 requires 2 kg
of resource R1 and 2 kg of resource R2. The profit per unit by selling
product P1 and P2 are Rs. 2000 and Rs 3000 respectively. The
manufacturer has 90 kg of resource R1 and 100 kg of resource R2.
(I) The unit worth of resource R2 i.e. dual price of resource R2 in Rs.
Per kg is
(A) 0 (B) 1350
(C) 1500 (D) 2000
(II) The manufacturer can make a maximum profit of Rs
(A) 60,000 (B) 1,35,000
(C) 1,500,000 (D) 2,00,000
Q.12 Shadow Price:

A company manufactures product P and Q in quantities X1 and X2

respectively using two resources. The following Linear Programming
Problem (LPP) is formulated to maximize the profit Z.

Maximize Z = 3 X1 + 2X2

Subject to

(i) X1 + 2X2 ≤ 2 (For Resource 1)

(ii) 2X1 + X2 ≤ 2 (For Resource 2)

And X1 ≥ 0, X2 ≥0

The shadow price for Resource 2 is

(A) 0 (B) 2/3

(C) 1 (D) 4/3

Q.13 If ‘m’ is the number of constraints in a linear programming with two
variables ‘x’ and ‘y’ and non negativity constraints x > 0, y > 0; the
feasible region in the graphical solution will be surrounded by how many
lines?
(A) m
(B) m+1
(C) m+2
(D) m+4
Q.14 Solve the following linear programming problem:
Maximize Z = 3X1 + 2X2 + 5X3
Subject to
X1 +2X2 + X3 ≤ 430
3X1 +2X3 ≤ 460
X1 +X2 ≤ 420
X1 ≥ 0, X2 ≥0, X3 ≥ 0
Q.15 Food X contains 6 units of Vitamin A per gram and 7 units of Vitamin B
per gram and costs 12 paise per gram.
Food Y contains 7 units of Vitamin A per gram and 12 units of Vitamin
B per gram and costs 20 paise per gram. The daily minimum requirement
of Vitamin A and Vitamin B is 100 units and 120 units respectively. Find
the minimum cost of product mix by Simplex method.
Q.16 Solve the given Minimization LPP by simplex method and verify the
solution with graphical method.
Minimize Z = 3X1 + 2X2

Subject to 2X1 +X2 ≤ 2

3X1 +4X2 ≥ 12
X1 +X2 ≤ 420
X1 ≥ 0, X2 ≥0
Q.17 A variable which has no physical meaning, but is used to obtain an initial
basic feasible solution to the linear programming problem is referred to
as:
(A) Basic variable
(B) Non-basic variable
(C) Artificial variable
(D) Basis
Q.18 Consider the following statements regarding the characteristics of the
standard form of a linear programming problem:
1. All the constraints are expressed in the form of equations.
2. The right-hand side of each constraint equation is non-negative.
3. All the decision variables are non-negative.
Which of these statements are correct?
(A) 1, 2 and 3
(B) 1 and 2
(C) 2 and 3
(D) 1 and 3
Q.19 Consider the following statements:
1. A linear programming problem with three variables and two
constraints can be solved by graphical method.
2. For solutions of a linear programming problem with mixed
constraints, Big-M method can be employed.
3. In the solution process of a linear programming problem using
Big-M-method, when an artificial variable leaves the basis, the
column of the artificial variable can be removed from all
subsequent tables.
Which of these statements are correct?
(A) 1, 2 and 3 (B) 1 and 2
(C) 1 and 3 (D) 2 and 3
Q.20 A tie for leaving variables in simplex procedure implies:
(A) Optimality
(B) Cycling
(C) No solution
(D) Degeneracy
Q.21 Write the dual equations of LPP if the primal equations are
Maximize Z = X1 - X2 + 3X3

Subject to (i) X1 + X2 + X3 ≤ 10
(ii) 2X1 - X2 - X3 ≤ 2
(iii) 2X1 - 2X2 - 3X3 ≤ 6
Q.22 Write the dual equations of LPP if the primal equations are
Minimize Z = 3X1 - 2X2 + 4X3

Subject to (i) 3X1 + 5X2 + 4X3 ≥ 7

(ii) 6X1 + X2 + 3X3 ≥ 4
(iii) 7X1 - 2X2 - X3 ≤ 10
(iv) 4X1 + 7X2 - 2X3 ≥ 2
(v) X1 - 2X2 + 5X3 ≥ 3
Q.23 Write the dual equations of LPP if the primal equations are
Minimize Z = X1 + 2X2

Subject to (i) 2X1 + 4X2 ≤ 160

(ii) X1 - X2 = 30
(iii) X1 ≥ 10