ITER, SIKSHA ‘O’ ANUSANDHAN (Deemed to be University) Assignment-1
Branch CSE/CSIT/ECE/EE/EEE Programme B. Tech
Course Name Operation Research Semester VIII
Course Code MEL 4438 Academic Year 2024-25
Assignment- 1 Topic: Linear Programming Problem
Learning L1: Remembering L3: Applying L5: Evaluating
Level (LL) L2: Understanding L4: Analysing L6: Creating
Q’s Questions Cos LL
Ozark farm uses at least 800lb of special feed daily. The special feed in a
mixture of corn and soyabean with the following composition.
Feed stuff Protein Fibre Cost ($/lb)
Corn 0.09 0.02 0.30fiber.
1. soyabean 0.60 0.06 0.90 CO1 L3
The daily requirements of the special feed are at cost 30% of protein and at
most 5% fibre. Ozark farm wishes to determine the daily minimum cost
fed mix.kp
Objective function Max Z= 5x1+4x2
Constraints are 6x1+4x2 ≤24
x1+2x2 ≤ 6
-x1+x2 ≤ 1
2. CO1 L3
x2 ≤ 2
X1, x2 ≥ 0
Solve the above problem using simplex method
A manufacturer produces two types of products, 1 and 2, at production
levels of x1 and x2 respectively. The profit is given is 2x1 + 5x2. The
production constraints are:
x1+3x2 ≤40,
3. 3 x1+x2 ≤ 24, CO1 L3
x1+x2 ≤ 10
x1, x2 ≥ 0
Find out the value of profit.
Minimize Z= 4X1+X2
L2
4. Subject to 3X1+X2=3; 4X1+3X2 ≥ 6; X1+2X2 ≤ 4; X1, X2 ≥ 0 CO1
Write the standard form.
Convert the primal problem to dual problem
a) Maximize Z= 40x1+35x2
Subject to 2x1+3 x2 ≤ 60; 4x1+3x2 ≤96; x1& x2 ≥ 0
5. CO1 L3
b) Minimize Z= 10x1+20x2
Subject to 3x1+2x2≥ 18; x1+3x2≥ 8; 2x1-x2 ≤ 6; x1& x2 ≥ 0
6. Consider the following Linear Programming Problem (LPP): CO1 L3
Maximize z = 3x1 + 2x2
Subject to x1 ≤ 4
x2 ≤ 6
3x1 + x2 ≤ 18
x1 ≥ 0, x2 ≥ 0
Find out which option is correct.
(a)The LPP has a unique optimal solution
(b)The LPP is infeasible
(c)The LPP is unbounded
(d)The LPP has multiple optimal solutions
Write the standard form of Linear programming problem using Big M
method
7. Minimize z=4x1+3x2
CO1 L2
Subject to 2x1+x2≥10, -3x1+2x2 ≤ 6, x1+x2≥6, x1, x2 ≥ 0
Note:
1. Assignment carries a weightage of 10 marks out of 100
2. All the course outcomes were covered.
Able to apply different mathematical tools in Linear Programming problems
CO1
solutions.
Able to apply the knowledge of different constraints in the application of
CO2 LPP and conversion between primal and dual problems.
Course
Outcomes Able to apply mathematical tools in distribution of resources based on
CO3
supply and demand.
Able to use network models and techniques in effective way in real life
CO4
projects.
CO5 Able to apply different models for future prediction of products.
Able to use different mathematical models in stock and various designs and
CO6
apply in real life.