Geetha Assignment

Geetha lakshmi k
B.SC(Mathematics)
III-YEAR
17421
1
1.What is OR?
Ans: Operational research is a scientific approach to
problem-solving for executive management.
2.What is LPP?
Ans: Linear programming is mathematical technique
useful for allocation of “SCARCE” or limited resources to
several competing activities on the basic of given criterion of
optimality.
3.Write the LPP structure?
Ans: Optimize (max or min)
Z=∑𝒏𝒋=𝟏 𝒆 𝒙𝒋 (objective function)
𝒋
Subject to the linear constraints

∑𝒏𝒋=𝟏 𝒂𝒊𝒋 𝒙𝒋 (≤, =, ≥)𝒃𝒋 ;i=1,2,3,...,m (constraints)
and 𝒙𝒋 ≥ 𝟎; 𝒋 = 𝟏, 𝟐, 𝟑, … , 𝒏 (non-negative condition).
4.Define solution.
Ans: The set of values of decision variables 𝑥𝑗
(j=1,2,3,…,n) that satisfy the constraints of an LPP is said to
be constitute the solution to that LPP.
2
5.Define feasible solution.
Ans: The set of values of decision variables
𝒙𝒋 (j=1,2,3,..,n) that satisfy all the constraints and non-
negativity conditions of an LP problem simultaneously is said
to constitute the feasible solution to that LP problem.
6.Define infeasible solution.
Ans: The set of values of decision variables
𝒙𝒋 (j=1,2,3,..,n) that satisfy all the constraints and do not satisfy
all the non-negativity conditions of an LP problem
simultaneously is said to constitute the feasible solution to that
LP problem.
7.Define basic and non-basic solution.
Ans: For a set of m simultaneously equations in n
variables (n>m) , a solution obtained by
(i)setting (n-m) variables equal to zero.
(i)setting for remaining m equations in m
variables is called a basic solution and m variables are called
basic variables.
The (n-m) variables whose value did not appear
in this solution are called non-basic variable and it’s value is
called non-basic solution.
8.Define basic feasible solution.
3
Ans: A feasible solution to LP problem which is
also the basic solution is called the basic feasible solution
that is all basic variable assume non-negative values.
9.What the types of basic feasible solution?
Ans: There are two types of basic feasible
solution.They are
(a)Degenerate
(b)Non-degenerate
DEGENERATE:
A basic feasible solution is called degeneration if
the value of atleast one basic variables is zero.
NON-DEGENERAATE:
A basic solution is said to be a non-degenerate
basic solution if none of the basic variables is zero.
10.Define optimal solution.
Ans: Any feasible solution which optimizes the
objective function of the LPP is called optimal solution.
11.Define slack variable.
Ans: If the constraints of a general LPP be
∑𝒏𝒋=𝟏 𝒂𝒊𝒋 𝒙𝒋 ≤ 𝒃𝒋 ;i=1,2,3,...,k -------- 1
Then the non-negative variables 𝒔𝒊 which are

introduced to convert the inequalities (1) to the equalities.
4
∑𝒏𝒋=𝟏 𝒂𝒊𝒋 𝒙𝒋 + 𝒔𝒊 = 𝒃𝒋 ;i=1,2,3,...,k are called
slack variables.
12.Define surplus variable.
Ans: If the constraints of a general LPP be
∑𝒏𝒋=𝟏 𝒂𝒊𝒋 𝒙𝒋 ≥ 𝒃𝒋 ;i=k,k+1,…… -------- 1
Then the non-negative variables 𝒔𝒊 which

are introduced to convert the inequalities (1) to the
equalities
∑𝒏𝒋=𝟏 𝒂𝒊𝒋 𝒙𝒋 − 𝒔𝒊 = 𝒃𝒋 ;i=k,k+1,…… are called
surplus variables.
13.Define unbounded solution.
Ans: A solution that can indefinitely increase or
decrease the value of the objective function of LPP is called
an unbounded solution.
i.e,If the value of objective function
indefinitely increases or decreases by solution . Then such a
solution is unbounded solution.
14.Define feasible region.
Ans: Feasible region is the overlapping area of
constraints which satisfies all the constraints on resources.
5
15.Define extreme point.
Ans: Extreme point refers to the corner of the
feasible region.
16.Define slack variables.
Ans: Slack variable represents a quantity of
unused resource. It is added to less than or equal to
constraints in order to get an equality constraints.
17.Define surplus variable.
Ans: Surplus variable represents the amount of
resource usage above the minimum requires.It is added to
greater than or equal to constraints in order to get equality
constraints.
18.Define artificial variable.
Ans: An artificial variable is added to the LPP
constraints to get an initial solution to an LPP. These
variables are added to those constraints with equality and
greater than or equal sign.
19.What is the standard form of LPP?
Ans: Optimize (m ax or min) Z=∑𝒏𝒋=𝟏 𝒄𝒋 𝒙𝒋 +
∑𝒎
𝒊=𝟏 𝒐𝒔𝒊
6
Subject to constraints (objective function)
∑𝒏𝒋=𝟏 𝒂𝒊𝒋 𝒙𝒋 + 𝒔𝒊 = 𝒃𝒊 ;i=1,2,3,...,m (constraints) and
𝒙𝒋 , 𝒔𝒊 ≥ 𝟎 for all i,j (non-negative condition)
20.What is the matrix form of standard LPP?
Ans: Optimize (max or min) Z=𝒄𝒙 + 𝒐𝒔
Sub to,
Ax+S=b and x,s≥0
Where,
C=(𝒄𝟏 , … … , 𝒄𝒏 ) row vectors
X=(𝒙𝟏 , … … , 𝒙𝒏 )^T coloumn vector
B=(𝒃𝟏 , 𝒃𝟐 , … … , 𝒃𝒎 )^T coloumn vector
S=(𝒔𝟏 , 𝒔𝟐 , … … , 𝒔𝒎 )
A – matrix of co-efficient of variables in
𝒙𝟏 , 𝒙𝟐 , … … , 𝒙𝒏 in constraints the.
21.Write the two methods which employ artificial
variables?
Ans:
• Big M-method
• Two phase method
7
22.What are methods to solve LPP?
Ans:
• Graphical method
• Simplex method
• Big M-method
• Two phase method
23.Define decision variables or activities.
Ans: The evaluation of various alternatives
(course of action) is guided by the nature of objective
function and availability of resources.
For this,we pursue (try to achieve a goal) certain
activities (also called decision variable) usually denoted by
𝒙𝟏 , 𝒙𝟐 , … … , 𝒙𝒏 .
24.Define requirements or components of LPP.
Ans:
• Decision variable
• Objective function
• Constraints and
• Non- negativity
25.Define objective function.
8
Ans: The objective (goal) function of each LPP is
expressed interms of decision variables to optimize the
criterion of optimality such as profit,cost,etc,...
26.Define constraints.
Ans: The objective function is always certain
limitation (or constraints) on the use of resources that limit
the degree to which an objective can be achieved.
Such a constraints must expressed as linear
equality or inequality of decision variable.
27.What are the characteristic of operation researches?
Ans:
• Inter disciplinary
• Scientific
• Holistic and
• Objective – oriented approach to decision
making.
28.Write the uses of slack , surplus , artificial variable?
Ans: It allow to convert inequalities into
equalities there by converting the given LPP into form that
is amenable to algebraic solution.
9
It permit us to make a more
comprehensive economic interpretation of a final solution.
Help us to get an initial feasible solution
represented by the columns of the identity matrix.
29.What are the decision making?
Ans:
• Product mix
• Production planning
• Trim less
• Profit planning
• Travelling salesman problem
• Staffing problem
• Job evaluation solution
• Media solution
30.Define dual LPP.
Ans: If primal LPP 𝒎𝒂𝒙 𝒛𝒙 = ∑𝒏𝒋=𝟏 𝒄𝒋 𝒙𝒋.
Sub to,
∑𝒏𝒋=𝟏 𝒂𝒊𝒋 𝒙𝒋 ≤ 𝒃𝒋 and𝒙𝒋 ≥ 𝟎 , for all j.
31.Define shadow price.
10
Ans: Shadow price represents increase
objective function value due to one – unit increase in the
right hand side (resource) of any constraint.
32.Define duality.
Ans: Duality implies that each LPP can be
analyzed in two different ways but would have equivalent
solutions.
33.State fundamental duality theorem.
Ans: It either the primal or dual problem has a
finite optimal solution.
Then the other one also possesses the
same solution and the optimal value of the objective
functions of two problems are equal(primal dual).
34.What are the importance of duality?
Ans: Importance of the dual LPP is in terms of
the information that it is provides about the value of the
resource.
35.State weak duality theorem.
Ans: Weak duality theorem states that “the dual of
the dual LPP is again the primal problem”.
11
36.Define graphical solution.
Ans: If the optimal solution of the LPP
determined by the graphical method , then such a solution
is called graphical solution.
12

Geetha Assignment

Uploaded by

Copyright:

Available Formats

Geetha Assignment

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Geetha Assignment

Uploaded by

Copyright:

Available Formats

Geetha lakshmi k

Subject to the linear constraints

Then the non-negative variables 𝒔𝒊 which are

Then the non-negative variables 𝒔𝒊 which

31.Define shadow price.

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.