Optimization in Engineering Question Bank

Section-A
1 Define a linear Programming Problem in standard form. (2011)
2 Define feasible solution of a linear programming problem. (2022)
What is the difference between simplex method and dual simplex method from optimality
3
point of view? (2010)
What the advantage of MODI method over stepping stone method of transportation problem.
4
(2011)
5 Write mathematical formulation of Assignment Problem. (2012/ 2014)
Define Basic feasible solution and optimal solution of Linear Programming Problem.
6
(2011)
7 Define slack variable with example. (2010)
What is the cost of penalty variable of some maximization linear programming problem in
8
penalty? (2011)
9 Write the mathematical form of transportation problem. (2015)
State the condition that a transportation problem becomes an assignment problem.
10
(2011)
What is the difference between constrained and unconstrained optimization problem?
11
(2024)
12 What are Kuhn Tucker Conditions? (2015)
13 What are the basic characteristics of a queuing model? (2017)
14 What is traffic Intensity in a queuing system? (2008)
15 What are assumptions of M/M/1 queuing system? (2010)
What is the advantage of Golden Search Method over Fibonacci Search Method?
16
(2018)
17 State Kuhn-Tucker Conditions in NLPP. (2011)
18 What are different types of Queue Discipline? (2015)
19 What do you mean by single channel queuing model? (2024)
20 What are the assumptions of M/M/1 queuing systems? (2010)
Section-B
Solve the given linear programming problem using graphical method:
Maximize Z= 5x + 5y
Subject to:
𝑥+𝑦≤4
21
3𝑥 + 8𝑦 ≤ 24
10𝑥 + 7𝑦 ≤ 35
𝑥 ≥ 0, 𝑦 ≥ 0
(2022)
Solve the following LPP by using simplex method:
Maximize Z: 4x1 + 10x2
Subject to:
2𝑥1 + 𝑥2 ≤ 50
22
2𝑥1 + 5𝑥2 ≤ 100
2𝑥1 + 3𝑥2 ≤ 90
𝑥1 ≥ 0, 𝑥2 ≥ 0
(2010)
Obtain the dual of the following Primal LPP:
Maximize Z = 2x1 - 4x2
23 Subject to:
𝑥1 + 5𝑥2 ≥ 4
3𝑥1 − 2𝑥3 ≥ 3
 𝑥1 ≥ 0, 𝑥2 ≥ 0
(2011)
Solve the following LPP for optimal solution by Big-M (Penalty Mathod):
Minimize Z = 15x1 + 10x2
Subject to:
24 3𝑥1 + 5𝑥2 ≥ 5
5𝑥1 + 2𝑥2 ≥ 3
𝑥1 ≥ 0, 𝑥2 ≥ 0
(2011)
Solve the given LPP by any suitable method:
Maximize Z = 3x1 + 2x2 + 5x3
Subject to: 𝑥1 + 2𝑥2 + 5𝑥3 ≥ 430
25 3𝑥1 + 2𝑥3 ≥ 460
𝑥1 + 4𝑥2 ≤ 420
𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0
(2022)
Solve the following linear programming problem by simplex method:
Maximize Z= 5x1 + 8x2(2011)
Subject to :
26 2𝑥1 + 𝑥2 ≤ 500
𝑥1 ≤ 150
𝑥2 ≤ 250
𝑥1 ≥ 0, 𝑥2 ≥ 0
Obtain the dual of the following primal LPP:
Maximize Z = 3x1 + 2x2 (2011)
Subject to:
27
2𝑥1 + 3𝑥2 ≥ 2
𝑥1 + 𝑥2 ≥ 1
𝑥1 ≥ 0, 𝑥2 ≥ 0
Solve the following LPP for optimal solution by Big-M(penalty) method:
Minimize Z = 15x1 + 10x2
Subject to:
28 𝑥1 + 5𝑥2 ≥ 4
3𝑥1 − 2𝑥2 ≥ 3
𝑥1 ≥ 0, 𝑥2 ≥ 0
(2011)
Solve the given LPP by any suitable method:
Maximize Z = 3x1 + 2x2 + 5x3
Subject to: 𝑥1 + 2𝑥2 + 5𝑥3 ≥ 430
29 3𝑥1 + 2𝑥3 ≥ 460
𝑥1 + 4𝑥2 ≤ 420
𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0
(2022)
Section-C
Find a starting solution to the transportation problem by Vogel’s Approximation Method. The
values in the interior boxes are cost of transportation between corresponding source(s) and
destination(D) and the values given in the right margin and lower margin are the supply
capacity and demand of sources and destination respectively.
D1 D2 D3 D4 D5
30
S1 21 16 25 13 11
S2 17 18 14 23 13
S3 32 27 18 41 19
Demand 6 10 12 15
(2022)
 A batch of four jobs can be assigned to four different machines. The set up time for each job
on various machine is given by the following table:
1 2 3 4
1 1 4 6 3
31 2 9 7 10 9
3 4 5 11 7
4 8 7 8 5
Find an optimal assignment of jobs to machine which will minimize the total set up time.
(2011)
Use branch and bound method to solve:
Maximize Z = 7x1 + 9x2
Subject to:
−𝑥1 + 3𝑥2 ≤ 6
32 7𝑥1 + 𝑥2 ≤ 35
𝑥1 ≤ 7
𝑥2 ≤ 7
𝑥1 ≥ 0, 𝑥2 ≥ 0 are integers
(2007)
A manufacturing company produce two different types of products P1 and P2. Both these
products are to be processed through two different machines M! and M2. Machine M1 is
available for 200 hours and M2 is available for 100 hours. The requirement of time on these
machines is as follows:
Product P1 Product P2
33 Machine M1 10 hours 6 hours
Machine M2 5 hours 4 hours
The company makes a profit of Rs 800 on sale of one product P1 and Rs 500 on sale of one
product P2. The company wants to know the qualities of products P1 and P2 to produce to
maximize the profit. Formulate the problem into a LPP.
(2011)
Find an initial feasible solution to the following transportation problem using Vogel’s
Approximation Method:
Source/ A B C Availability
Destination
S1 3 6 5 15
34
S2 5 4 1 9
S3 2 5 6 11
S4 3 3 7 20
Requirement 20 17 18 55
(2013)
Find an optimal solution to an assignment problem with following cost matrix:
Job/Person A B C D
1 3 12 8 6
35 2 14 6 12 9
3 16 11 14 12
4 5 14 11 10
(2013)
Three fertilizer factories X, Y, Z located at three different places of the country produce 6, 4
and 5 lakh tonnes of urea respectively. Under direction of Govt., they are to distribute to 3
states A, B, C as 5, 3 and 7 lakh tonnes respectively. The transportation cost per tonne in rupee
36 is given below:
A B C
X 11 17 16
Y 15 12 14
 Z 20 12 15
Find out suitable transportation pattern minimum cost.
(2009)
Section-D
Solve by Fibonacci Search Method: Minimize f(x)= x2 + 54/x in the internal (0,5].
37
(2019)
38 Write a short note on: Non-linear Programming. (2019)
Solve the following NLPP by Kuhn-Tucker conditions:
Max Z= 2x1 + x2 -x12
Subject to
39
2x1 +3x2≤ 6
2x1 +2x2≤ 4
Where x1 ,x2≥0 (2019)
Solve the given NLPP by Golden Section Search Method: Minimize Z = 4x2 + 33/x in the
40
interval [0,3].
Solve the following NLPP by Lagrange’s multiplier:
Max Z = x12 + x22 +3x1+4x2.
41 Subject to
2x1 + x2 = 10
x1,x2≥0 (2018)
Solve the following NLPP by Kuhn-Tucker conditions:
Max Z= 2x1 + x2 -x12
Subject to
42
2x1 +3x2≤ 6
2x1 +2x2≤ 4
Where x1 ,x2≥0 (2019)
Solve the given NLPP by Golden Section Search Method: Minimize Z = 4x2 + 33/x in the
43
interval [0,3].
Solve by Fibonacci Search Method: Minimize f(x)= x2 + 54/x in the internal (0,5].
44
(2019)
45 Write a short note on: Non-linear Programming. (2019)
Solve the following NLPP by Lagrange’s multiplier:
Max Z = x12 + x22 +3x1+4x2.
46 Subject to
2x1 + x2 = 10
x1,x2≥0 (2018)
Section-E
In a bank, the cheque are cashed by a single teller. Customers wishing to cash cheques arrive
in a poisson manner at a rate of 20 customers per day. The teller takes an average 10 minutes
to cash the cheque. The service time is shown to be exponentially distributed.
47
(i) Compute the percentage of time the teller is busy.
(ii) Compute average time a customer is expected to wait.
Assume bank operate from 10AM to 2PM on each working day. (2010)
48 Define a queue and explain various queue discipline. (2024)
49 Explain general Characteristic of Queuing Theory. (2023)
50 Define a queue and explain various queue discipline. (2024)
In a bank, the cheque are cashed by a single teller. Customers wishing to cash cheques arrive
in a poisson manner at a rate of 20 customers per day. The teller takes an average 10 minutes
to cash the cheque. The service time is shown to be exponentially distributed.
51
(iii) Compute the percentage of time the teller is busy.
(iv) Compute average time a customer is expected to wait.
Assume bank operate from 10AM to 2PM on each working day. (2010)
52 Explain general Characteristic of Queuing Theory. (2023)