Scribd
Upload
5 views

CSE 7th sem assignment (1)

Uploaded by

raghavsahi1902
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

CSE 7th sem assignment (1)

Uploaded by

raghavsahi1902
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ASSIGNMENT-1

OPTIMIZATION TECHNIQUES
B.TECH-2024-25
SEMESTER-7(CSE)
Marks-10
Note: All questions are compulsory and carry equal marks.
1.Write short notes on engineering applications of optimization.
2.Write short notes on single-variable optimization.
3.Write short notes on multi-variable optimization with no constraints.
4.Define the following:
(i) Design vector
(ii) Design constraints
(iii) Constraint surface
(iv) Objective function
(v) Objective function surface
5.Write short notes of computational procedure of the simplex method for the solution of a
maximization L.P.P.
6. Solve by simplex method the following L.P.problem
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 3𝑥1 + 5𝑥2 + 4𝑥3
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥1 + 3𝑥2 ≤ 8
2𝑥2 + 5𝑥3 ≤ 10
3𝑥1 + 2𝑥2 + 4𝑥3 ≤ 15
𝑎𝑛𝑑 𝑥1 , 𝑥2 , 𝑥3 ≥ 0
7.Solve by simplex method the following L.P.problem
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑥1 − 3𝑥2 + 2𝑥3
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 3𝑥1 − 𝑥2 + 2𝑥3 ≤ 7
−2𝑥1 + 4𝑥2 ≤ 12
−4𝑥1 + 3𝑥2 + 8𝑥3 ≤ 10
𝑎𝑛𝑑 𝑥1 , 𝑥2 , 𝑥3 ≥ 0
8. Solve the following L.P.P. by using the two phase method
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑥1 + 𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥1 + 𝑥2 ≥ 4
𝑥1 + 7𝑥2 ≥ 7
𝑎𝑛𝑑 𝑥1 , 𝑥2 ≥ 0
9. Solve the following L.P.P. by Big-M method:
𝑀𝑎𝑥 𝑍 = 𝑥1 + 2𝑥2 + 3𝑥3 − 𝑥4
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑥1 + 2𝑥2 + 3𝑥3 = 15
2𝑥1 + 𝑥2 + 5𝑥3 = 20
𝑥1 + 2𝑥2 + 𝑥3 + 𝑥4 = 10
𝑎𝑛𝑑 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
10. Use Big-M method to solve the following problem:
𝑀𝑎𝑥 𝑍 = −2𝑥1 − 𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 3𝑥1 + 𝑥2 = 3
4𝑥1 + 3𝑥2 ≥ 6
𝑥1 + 2𝑥2 ≤ 4
𝑎𝑛𝑑 𝑥1 , 𝑥2 ≥ 0

You might also like