Scribd
Upload
15 views2 pages

OR Setwise Assignment-1 Asec Questions

The document contains a set of operational research assignment questions divided into five sets, each focusing on different methods and problems related to linear and non-linear programming. Topics include the structure of linear programming, the simplex method, graphical methods, and the Big-M method. Each set includes specific problems to solve and procedures to describe, aimed at enhancing understanding of operational research techniques.

Uploaded by

pdk1433225
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
15 views2 pages

OR Setwise Assignment-1 Asec Questions

The document contains a set of operational research assignment questions divided into five sets, each focusing on different methods and problems related to linear and non-linear programming. Topics include the structure of linear programming, the simplex method, graphical methods, and the Big-M method. Each set includes specific problems to solve and procedures to describe, aimed at enhancing understanding of operational research techniques.

Uploaded by

pdk1433225
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

OPERATIONAL RESEARCH SET WISE ASSIGNMENT QUESTIONS

INTERNAL – 2

SECTION-A

SET – I (R.no 1 - 12)

1. Explain about structure of linear program and advantages of L.P ?


2. Simplex method
Maximise Z = 3x1+2x2+5x3
Subject to constraints : x1+2x2+x3 ≤ 430
3x1+2x3 ≤ 460
x1+2x2 ≤ 420
x1, x2, x3 ≥ 0
3. General structure of Non-Linear programming problem ?

SET – 2 (R.no 13 - 25)

1. Write about OR briefly ?


2. Problem : Graphical method
Solve the following LPP using graphical method
Maxmimum Z = 100x1+60x2
Subject to constraints : 5x1+10x2 ≤ 50
89x1+2x2 ≥16
3x1+2x2 ≥ 6
x1 & x2 >0
3. Write about steps for Simplex Method Procedure ?

SET – 3 (R.no 26 - 39)

1. Solve the following LPP using graphical method


mini Z = 12x1+16x2
subject to constraints : 10x1+20x2 ≤ 120
8x1+8x2 ≤ 80
x1, x2 ≥ 0
2. Simplex Method Problem
minimize Z = x1-3x2+2x3
subject to constraints : 3x1-x2+3x3 ≤ 7
-2x1+4x2 ≤ 12
-4x1+3x2+8x3 ≤ 10
x1, x2, x3 ≥ 0
3. Write the procedure for Big-M method ?

SET – 4 (R.no 40 – 97)

1. Write Graphical Method Procedure ?


2. Solve the following LPP using Big-M method
mini Z = 2x1+3x2
subject to constraints : x1+x2≥ 5
x1+2x2 ≥ 6
x1, x2 ≥ 0
3. Solve the following LPP in Graphical Method
minimize Z = 4x1+6x2
subject to constraints : x1+x2 ≥ 8
6x1+x2 ≥ 12
x1 & x2 ≥ 0
SET – 5(R.no 98 – 119)
1. Write the procedure of Big-M method ?
2. Solve the following LPP using Simplex Method
Max Z = 12x1+16x2
subject to constraints : 10x1+20x2 ≤ 120
8x1+8x2 ≤ 80
x1 & x2 ≥ 0
3. Big-M Method
Max Z = 6x1+4x2
Substitute to the constraints : 2x+3x ≤ 30
3x+2x ≤ 24
x1+x2 ≥ 3
x1, x2 ≥ 0

You might also like