Scribd
Upload
25 views4 pages

QB Question Bank Sem4 Comp IAT2 CO5 LPP AND CO6 NLPP

The document contains a question bank for Non-Linear Programming Problems (NLPP) and Linear Programming Problems (LPP) for a computer science course. It includes various optimization problems using methods such as Lagrange's multiplier and Kuhn-Tucker conditions, as well as the Simplex and Big M methods. Each problem is categorized by its Bloom's Taxonomy Level (BTL).

Uploaded by

sangoi_vipul
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
25 views4 pages

QB Question Bank Sem4 Comp IAT2 CO5 LPP AND CO6 NLPP

The document contains a question bank for Non-Linear Programming Problems (NLPP) and Linear Programming Problems (LPP) for a computer science course. It includes various optimization problems using methods such as Lagrange's multiplier and Kuhn-Tucker conditions, as well as the Simplex and Big M methods. Each problem is categorized by its Bloom's Taxonomy Level (BTL).

Uploaded by

sangoi_vipul
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/ 4

QUESTION BANK IAT2 NLPP AND LPP SE COMPUTER SEM-IV ( 24-25)

NLPP CO6
1 Using Lagrange’s multiplier method, BTL3
2 2 2
Optimise Z = 2x + 2x + 2x – 24x1 - 8x2 – 12x3 + 196
1 2 3
subject to x1 + x2 + x3 = 11, x1, x2 , x3 ≥ 0
2 Using Lagrange’s multiplier method, BTL3
2 2 2
Optimise Z = 2x + 3x + x
1 2 3
subject to x1 + x2 + 2x3 = 13, 2x1 + x2 + x3 = 10, x1, x2 , x3 ≥ 0
3 Use Kuhn-Tucker conditions to solve the following NLPP: BTL3
2 2
Maximise Z = 2x -7x - 16x1 + 2x2 + 12x1 x2 + 7
1 2
subject to 2x1 + 5x2 ≤ 105, x1, x2 ≥ 0

4 Using Lagrange’s multiplier method, BTL3


2 2
Optimise Z = 5x1 + x2 - x - x1 2 - 2 x1 x2
subject to x1 + x2 = 4, x1, x2 ≥ 0
5 BTL3
Using Lagrange’s multiplier method,

Optimise Z= x2 +y2+z2 -10x-4z-6y Subject to x +y +z=7, x, y, z ≥ 0

6 BTL3
Use Kuhn-Tucker conditions to solve the following NLPP:

Maximise z= 8x+10y-x2-y2 Subject to 3x +2y ≤ 6 , x, y ≥ 0

LPP CO5
1 BTL!
2 BTL2

3 Solve using Simplex method: BTL3

4 Solve using Simplex method: BTL3

5 Solve using penalty method(Big M method): BTL3

6 Solve using penalty method(Big M method): BTL3


7 BTL3

8 BTL3

9 BTL3

10 BTL3

You might also like