Scribd
Upload
113 views5 pages

Operations Research Unit 1,2 QB

Uploaded by

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

Operations Research Unit 1,2 QB

Uploaded by

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

1

2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

19
20
21
22
23

1
2
3
4
5

8
9
10
11
12
13
14
15
16
17

1
2
3
4
5
6
7

10
11

12

1
2
3
4
5
6
module 1 - part B

Define Operation Research and give short note on its origin


Give short note on nature of Operation Research
Write briefly about the significant features of Operation Research.
Why Operation Research is used for decision making?
Define [a] Iconic model [b] Analog model [c] Mathematical model.
Define [a] Static model [b] Dynamic model [c] Deterministic model and [d] Stochastic model with an example
Write short note on Simulation and Analytic model with an example
Give the charteristic of good model.
Describe how models are divided based on the functions
Illustrate models classification based on nature of environment with an example.
Give limitations of Operation Research
write short note on applications of Operation Research

Give the general methods for solving Operation Research problems.


Write short note on different phases of Operation Research
Write the mathematical formulation of Linear Programming Problem
Write the procedure for solving Linear Programming Problem model
A firm manufactures two types of products A and B and sells them at a profit of Rs. 2 on type A and Rs. 3 on type B. Each p
processe
Define Proportionality, additivity.
Define finiteness,divisibility,optimality
Give an example of convex and non-convex region
Write the advantages and disadvantages of Linear Programming Problem
State the limit of graphical method of solving Linear Programming Problem.

MODULE 2 - PART B
Define feasible, optimum solution
Write the general form of general Linear Programming Problem
Explain briefly about slack and surplus variables.
Describe briefly about various solution of general Linear Programming Problem
Express the following Linear Programming Problem in the canonical form. Maximize Z=2x+3x+x , subject to the constraints 4x
x+5x-7x≥-4 and x ,x≥0, x is unrestricted.
xpress the following Linear Programming Problem in the Standard form. Minimize Z=5x+7x , subject to the constraints x+x≤8;
6x+7x ≥5 and x ,x≥0.
Express the following Linear Programming Problem in the Standard(matrix) form. Maximize Z=4x+2x+6x , subject to 2x+
3x+4x=8; 6x-4x+x≤10 and x ,x ,x≥0.
Give the charteristics of Standard form.
Define canonical form of general Linear Programming Problem.
Define the Standard form of general Linear Programming Problem.
Give brief introduction about Simplex method
define 1.)Basic solution 2.)Degenerate solution 3.)Basic- feasible solution
Define 1.)Unbounded solution 2.)Fundamental condition on simplex method.
Define 1.)Pivot column 2.)Pivot equation
Explain the procedure for maximization problem in Simplex Method.
Explain the procedure for minimization problem in Simplex Method.
Find all the basic solutions to the following problem: Maximize Z=x +3x +3x , subject to x +2x +3x =4: 2x 1 2 3 +3x +5
find which of the basic solutions are i)basic feasible ii)non- degenerate basic feasible iii)optimal basic feasible.

Module 1 - part c
Write in detail about operation research and its origin
Explain briefly about nature and features of operational research
Explain in detail about classification of models
Describe classification of models based on i) functions and ii) structure with an example
n Explain in detail about main phases of operational research
Write in detail about advantages and disadvantages of operational research
) Write the mathematical formulation of Linear programming problem. ii) Write the procedure for solving Linear prog
problem model.
A frim produces 3 products. These products are processed on three different machines. The time required to manufacture on
each MACHINE 1 Time per unit(mi Prod Prod Prod Machine capacity (machine/day) M 2 3 2 440 2 M 4- 3 470 3 M 2 5-430 It is
to determine the number of units to be manufactured for each product daily. The profit per unit of product 1,2 and 3 is Rs. 4,
A farmer has 100 acre farm .he can sell all tomatoes ,lettuce or raddishes he can raise. The price he can obtain is Rs.1 p
tomatoes,Rs
Solve the following linear programming problem by the graphical method. Max Z=3x+2x Subject to -2x+x 1 x 2 x+x 3 and
A company manufactures 2 types of printed circuits . The requirements of transistors, resistors and capacitors for each type o
circu Circuit stock available A B Transistor 15 10 180 Resistor 10 20 200 Capacitor 15 20 210 Profit Rs.5 Rs.8 How many circuit
type should the company produce from the stock to earn maximum profit
Apply graphical method to solve the linear programming problem: Max Z=x-2x Subject to -x+x 1 6x+4x 24 0 x 5 and

module 2 part c
Explain in detail about general linear programming problem
Explain in detail about solutions of general linear programming problem.
Explain in detail about canonical form of general linear programming problem and its characteristics.
Describe in detail about standard form of general linear programming problem and its characteristics.
Illustrate simplex algorithm
An automobile manufacturer makes automobiles and trucks in a factory that is divided into two shops.Shop A ,which pref
basic as
part c

Write in detail about operation research and its origin


Explain briefly about nature and features of operational research
Explain in detail about classification of models
Describe classification of models based on i) functions and ii) structure with an example
n Explain in detail about main phases of operational research
Write in detail about advantages and disadvantages of operational research
) Write the mathematical formulation of Linear programming problem. ii) Write the procedure for solving Linear programming
A frim produces 3 products. These products are processed on three different machines. The time required to manufact
MACHINE 1 Time per unit(mi Prod Prod Prod Machine capacity (machine/day) M 2 3 2 440 2 M 4- 3 470 3 M 2 5-430 It is requ
number of units to be manufactured for each product daily. The profit per unit of product 1,2 and 3 is Rs. 4, R
A farmer has 100 acre farm .he can sell all tomatoes ,lettuce or raddishes he can raise. The price he can obtain is Rs.1 per kg fo
Solve the following linear programming problem by the graphical method. Max Z=3x+2x Subject to -2x+x 1 x2 x+
A company manufactures 2 types of printed circuits . The requirements of transistors, resistors and capacitors for each type
stock available A B Transistor 15 10 180 Resistor 10 20 200 Capacitor 15 20 210 Profit Rs.5 Rs.8 How many circuits of each typ
produce from the stock to earn maximum profit
Apply graphical method to solve the linear programming problem: Max Z=x-2x Subject to -x+x 1 6x+4x 24 0 x 5 and

UNIT 2
Explain in detail about general linear programming problem
Explain in detail about solutions of general linear programming problem.
Explain in detail about canonical form of general linear programming problem and its characteristics.
Describe in detail about standard form of general linear programming problem and its characteristics.
Illustrate simplex algorithm
An automobile manufacturer makes automobiles and trucks in a factory that is divided into two shops.Shop A ,which preform

You might also like