Final Revision Part 1 Or-2024 New

Operations Research
Matrix Center
2023 - 2024 Revision Part 1
Mahmoud Soliman
Matrix Center Page|1
MCQ
[1] To determine the accepted or rejected space for each constraint we use ….... point
(a) reference (b) minimum (c) maximum (d) none of these
When graphing a constraint we determine the direction of the inequality by using test point or reference point.
[2] OR models designed to ….... a specific objective criterion subject to a set of constraints.
(a) optimize (b) minimize (c) maximize (d) none of these
[3] In general, any OR model consists of ---- components.

(a) 4 (b) 5 (c) 3 (d) none of these
Any OR model consists of: (1) decision variables that we seek to determine, (2) objective criterion (goal) that we aim to optimize, and (3)
constraints that we need to satisfy.
[4] We can look to any OR problem as a decision-making problem whose solution requires determining
(a) decision variables (b) objective criterion (c) constraints (d) All of the above
[5] The solution that meets (satisfies) all constraints is considered -----
(a) feasible (b) unique (c) unfeasible (d) none of these
A feasible solution satisfies all constraints, (doesn't violet any of the constraint).
[6] A solution of the model is …….., if it satisfies all the constraints.

(a) optimal (b) unique (c) feasible (d) none of these
[7] A solution is considered ….... if it does not satisfy one of the constraints
(a) feasible (b) unique (c) infeasible (d) none of these
An infeasible solution violets at least one of the constraint
[8] An ---------solution, in addition to being feasible, it yields the best (Maximum or minimum) value of the objective function.
(a) feasible (b) optimal (c) unfeasible (d) none of these
[9] There are ----- principal phases for implementing OR in practice.

[10] Which phase involves defining the scope of the problem under investigation.
(a) construction (b) implementation (c) validation (d) definition of the problem
[11] The phase in which the research describes the decision alternatives, is called ------- of the problem
(a) construction (b) implementation (c) validation (d) definition
[12] The phase in which the research determines of the objective of the study and specifies the limitations under
which the modeled system operates is called ------- of the problem
[13] Problem ------------ should be carried out by the entire OR team.

[14] The phase in which the research translates the problem definition into mathematical relationships is called -------- of the model.
[15] The phase that entails the use of well-defined optimization algorithms is called ---- of the model.
(a) construction (b) implementation (c) solution (d) none of these
[16] The phase in which the researcher test whether the solution is applicable or not is called…... of the model.
(a) optimization (b) implementation (c) validation (d) none of these
Model validity checks whether or not the proposed model does what it purports to do.
Mahmoud Soliman 01 22 22 47 596

[17] The phase, in which the OR team should be convinced that the model’s output does not include “surprises”?, is called…... of
the model.
[18] The phase, in which the researcher compares its output with historical output data, is called…... of the model.
[19] The phase, in which the research translates the solution of a validated model into understandable operating instructions, is
called-------of the model
[20] When the objective function assumes the same optimal solution at more than one point, this special case is called------solution
(a) alternative (b) unbounded (c) non existing or infeasible (d) degenerate
Note that: this special case is called alternative optima or alternative solution or infinity number of optimum solutions.
[21] There are an infinite number of optimal solutions in the special case; called-------
(a) Degeneracy (b) unbounded (c) alternative optima (d) none of these
[22] The special case, where both the solution space and the "optimum" objective value are unbounded is called--------solution.
[23] LP model with inconsistent constraints have ………. solution.

[24] The special case, where there is no feasible solution is called--------solution.

[25] The special case that occurs when the optimum solution is overdetermined by a redundant constraint is called ---------solution
[26] In the degeneracy case there will be a constraint that called ----
(a) abundant (b) degenerate (c) redundant (d) none of these
A redundant constraint is a constraint that can be omitted from the system without changing the set of feasible solutions.
[27] A linear programming model as any OR model consists of------ components

A linear programming model as any OR model consists of decision variables, objective function, and constraints.
[28] ------------- is the most prominent OR technique. It is designed for models with linear objective and constraint functions.
(a) Linear programming (b)Nonlinear programming (c) Integer programming (d) Dynamic programming
[29] In ------------- the functions of the model are nonlinear.

[30] In ------------- the variables assume integer values.

[31] In ------------- the original model can be decomposed into smaller more manageable sub-problems.
[32] In ------------- the problem can be modeled as a network.

(a) Linear programming (b) Network programming (c) Integer programming (d) Dynamic programming

[33] -----------is a procedure that is normally carried out after the optimum solution is obtained. It determines how sensitive the
optimum solution is to making certain changes in the model parameters (objective and constraint). It gives the model a
dynamic characteristic.
(a) feasibility analysis (b) sensitivity analysis (c) validation (d) none of these
[34] Studying the effect of making changes in the model parameters on a given optimum LP solution is.
(a) feasibility analysis (b) sensitivity analysis (c) validation (d) none of these
[35] Which of the following is needed for obtaining additional information about the behavior of the optimum solution when the
model undergoes some parameter changes?
(a) Problem definition (b) sensitivity analysis (c) validation (d) none of these
[36] ………………is needed when the parameters of the model cannot be estimated accurately.
(a) Problem definition (b) sensitivity analysis (c) validation (d) none of these
[37] Calculating the range of -------- helps in studying changes in objective coefficients.
(a) optimality (b) feasibility (c) both a and b (d) none of these
[38] Calculating the range of ------------helps in studying the changes in constraints.

(a) optimality (b) feasibility (c) both a and b (d) none of these
[39] Changes in the unit worth of resource indicates the changes in ----------
(a) number of variables (b) objective function (c) constraints (d) none of these
[40] The region represented by is:

(a) first quadrant (b) second quadrant (c) third quadrant (d) fourth quadrant
[41] The first formal activities of Operations Research (OR) were initiated in England during--------
(a) World War I (b) World War II (c) Unknown (d) none of these
True & false
[1] The problem implementation involves defining the scope of the problem under investigation. F (definition)
[2] To determine the accepted or rejected space for each constraint we use reference point. T
[3] The linear programming model must have only two variables. T
[4] Calculating the range of feasibility helps in studying changes in objective coefficients. F (optimality)
[5] Calculating the range of optimality helps in studying the changes in constraints. F (feasibility)
[6] Changes in the unit worth of resource indicate the changes in constraints. T
[7] There is infinity number of optimal solutions in the special case which called alternative optimum solution. T
[8] The special case that occurs when the optimum solution is overdetermined by a redundant constraint is called alternative solution.
False (degenerate solution)
[9] The special case, where there is no feasible solution is called degenerate solution. False (Infeasible solution)
[10] LP model with inconsistent constraints is called unbounded solution. False (Infeasible solution)
[11] The special case, where both the solution space and the "optimum" objective value are unbounded is called infeasible solution.
False (unbounded solution)
[12] There are an infinite number of optimal solutions in the special case; called unbounded. False (alternative optimal solution)
[13] In the degeneracy case there will be a constraint that called a abundant constraint. False (redundant)
List the principal phases for implementing OR in practice?

Answer
1. Definition of the problem.
2. Construction of the model.
3. Solution of the model.
4. Validation of the model.
5. Implementation of the solution.

Exercise: 1
Maximize: Z = 5X1 + 4X2
Subject to
X1 + X2 ≤ 4.5
6X1 + 4X2 ≤ 24
X1 + 2X2 ≤ 6
X1, X2 ≥ 0
Use the graphical solution to answer the following questions
[1] The number of feasible solutions is
(a) 5 (b) 4 (c) 1 (d) Infinite
[2] The solution space has …... corner points
[3] The coordinates x1 & x2 respectively for the optimum solution are
(a) (2,6) (b) (0,2) (c) (3 , 1.5) (d) none of these
[4] The optimum solution for this model is
[5] Is there any redundant constraint?
(a) No (b) yes (c) Cannot be determine (d) none of these
[6] If there is a redundant constraint, which one is it?
(a) The first constraint (b) The second constraint (c) The third constraint (d) none of these
The first constraint: X1 + X2 ≤ 4.5
[7] The type of solution for this model is;

(a) Degeneracy (b) unbounded (c) infeasible (d) none of these
The model is a special case of liner programming (Degenerate case)
Answer:
X1 + X2 ≤ 4.5
X1 + X2 = 4.5
When X1 = 0 , X2 = 4.5 (0 , 4.5)
When X1 = 4.5 X2 = 0 (4.5 , 0)
6X1 + 4X2 ≤ 24
6X1 + 4X2 = 24
When X1 = 0 , X2 = 6 (0,6)
When X1 = 4 X2 = 0 (4,0)
X1 + 2X2 ≤ 6
X1 + 2X2 = 6
When X1 = 0 , X2 = 3 (0,3)
X1 = 6 , X2 = 0 (6,0)
 Corner [A] = (0,0)
 Corner [B] = (4,0)
 Corner [D] = (0,3)
nd rd
 To find corner [C], select any two lines passing through corner C [Solve the 2 and the 3 equations algebraically]
6X1 + 4X2 = 24 (÷ 2) 3X1 + 2X2 = 12 by subtracting
X1 + 2X2 = 6 X1 + 2X2 = 6
2x1 = 6 x1 = 3 , x2= 1.5 Then corner c = (3,1.5)
Determination of the optimal solution
Corner points: Z = 5X1 + 4X2
At: A = (0,0) Z = 5(0) + 4(0) = 0
B = (4,0) Z = 5(4) + 4(0) = 20
C = (3,1.5) Z = 5(3) + 4(1.5) = 21 (optimal)
D = (0,3) Z = 5(0) + 4(3) = 12
 The solution is degenerate because there are three lines pass through the optimum point, the optimum point is overdetermined and
one of the constraints is redundant.
 A redundant constraint is a constraint that can be omitted from the system without changing the set of feasible solutions.

Exercise: 2
If you have the following linear programming model;
Max Z = 3x1 + 9x2
S.t:
6x1 + 4x2 8
x1 + 2x2 4
x1 , x2 0
[1] The number of the structural constraints is
(a) (2,6) (b) (0,2) (c) (2,1) (d) none of these
(a) The first constraint (b) The second constraint (c) Cannot be determine (d) none of these
[7] The type of solution for this model is .......
This is a special case of liner programming (Degenerate solution)
The solution is degenerate because there are three lines pass through the optimum point, the optimum point is overdetermined and
one of the constraints is redundant.
Solution:
 6x1 + 4x2 8
6x1 + 4x2 8
x1 = 0 x2 = 2 (0 , 2)
x1 = x2 = 0 ( )
 x1 + 2x2 4
x1 + 2x2 4
x1 = 0 x2 = 2 (0 , 2)
x1 = x2 = 0 ( , 0)
The determination of optimal solution:

Corner Max Z = 3x1 + 9x2
A = (0 , 0) Z = 3(0) + 9(0) = 0
B = ( , 0) Z = 3( ) + 9(0) = 4
C = (0 , 2) Z = 3(0) + 9(2) = 18
The point ( = 2) is optimal degenerate solution. And the solution is degenerate.
Comment: This is a special case of liner programming (Degenerate solution)

The solution is degenerate because this is a two dimensional problem, and three lines pass through the optimum
point, the point is overdetermined and one of the constraints is redundant.

Exercise: 3
Max: z = 2x1 + x2
S.t: x1 – x2 10
2x1 40
x1 , x2 0
[1] The number of structural constraints is

There are two structural and two non-negativity constraints.

[4] The solution space for this model is

(a) bounded (b) unbounded (c) 7 (d) none of these

(a) 18 (b) 9 (c) Unbounded (d) none of these
[6] Is there any redundant constraint?

(a) No (b) yes (c) Cannot be determine (d) none of these

(a) The first constraint (b) The second constraint (c) Both a and b (d) none of these
[8] The type of solution for this model is…..

This is a special case of liner programming (Unbounded solution)
[9] The special case, where both the solution space and the "optimum" objective value are unbounded is called--------solution.
Answer
 x1 – x2 10
x1 – x2 = 10
x1 = 0 x2 = -10 (0 , -10)
x1 = 10 x2 = 0 (10 , 0)
 2x1 40
2x1 = 40
x1 = 20 vertical
(0 , 20) (10 , 20)
Since the solution space is unbounded in the direction of increasing z and the objective function is maximization then The
optimum objective value is unbounded.

Exercise: 4
Max: z = 3x1 + 6x2
S.t: 3x1 +4x2 12
-2x1 + x2 4
x1 , x 2 0
Solution:




3x1 +4x2 12
3x1 +4x2 12
x1 = 0 x2 = 3 (0 , 3)
x1 = 4 x2 = 0 (4 , 0)
-2x1 + x2 4
-2x1 + x2 4
x1 = 0 x2 = 4 (0 , 4)
x1 = -2 x2 = 0 (-2 , 0)
 The solution space is unbounded.

 The optimum objective value is unbounded.
Comment:

Exercise: 5
Max: z = 2x1 + x2
S.t: 2x1 + x2 8
x1 + 3x2 8
x 1 , x1 0
(a) (4,0) (b) ( 3.2, 1.6 ) (c) A and b are true (d) none of these
[3] The number of points that gives the optimum value z
(a) 3 (b) 3 (c) infeasible (d) infinite
The optimal solution is at ( ) or at (4 , 0) or at any point in between. (There are an infinite number of points that gives the
same optimum value of Z = 8)
[5] The type of solution for this model is
(a) Degeneracy (b) Alterative (c) infeasible (d) none of these
This is a special case of liner programming (Alterative or infinite optimal solution)
[10] When the objective function assumes the same optimal solution at more than one point, this special case is called------solution
[11] There are an infinite number of optimal solutions in the special case; called-------
(a) Degeneracy (b) unbounded (c) alternative optimal (d) none of these
Answer:
2x1 + x2 8
2x1 + x2 = 8
x1 = 0 x2 = 8 (0 , 8)
x1 = 4 x2 = 0 (4 , 0)
x1 + 3x2 8
x1 + 3x2 = 8
x1 = 0 x2 = ( )
x1 = 8 x2 = 0 (8 , 0)
To determine corner C, we solve:

2x1 + x2 = 8 2x1 + x2 = 8
x1 + 3x2 = 8 (* -2) -2x1 - 6x2 = -16
5x2 = 8 x2 =
in any equation to get the value of then corner C = ( ) or ( 3.2, 1.6 )
Determination of optimal solution:
Corner z = 2x1 + x2
A (0 , 0) z = 2(0) + 1(0) = 0
B (4 , 0) z = 2(4) + 1(0) = 8
C( ) z = 2( ) + 1( )=8
D( ) z = 2(0) + 1( )=
The optimal solution is at corner C ( )or corner B (4 , 0) or at any point on the line segment ̅̅̅̅ and z = 8
This is a special case of liner programming (Alterative or infinite optimal solution)

Exercise: 6
Max: z = 3x1 + 2x2
S.t: 2x1 + x2 2
3x1 + 4x2 12
x1 , x 2 0
There is no feasible solution space
(a) (0,2) (b) ( 1, 0 ) (c) (0,3) (d) none of these

(a) 4 (b) 3 (c) Unbounded (d) infeasible

(a) Degeneracy (b) Alterative (c) infeasible (d) none of these
Since the constraints are inconsistent, then the solution is infeasible. This is a special case of liner programming: infeasible solution.
[5] The special case, where there is no feasible solution is called--------solution.

[6] LP model with inconsistent constraints has ………. solution.

(a) alternative (b) unbounded (c) infeasible (d) degenerate
Answer:
 2x1 + x2 2
2x1 + x2 = 2
x1 = 0 x2 = 2 (0 , 2)
x1 = 1 x2 = 0 (1 , 0)
 3x1 + 4x2 12
3x1 + 4x2 = 12
x1 = 0 x2 = 3 (0 , 3)
x1 = 4 x2 = 0 (4 , 0)
 The solution is infeasible.

 LP model with inconsistent constraints have no feasible solution.

Matrix Center P a g e | 10
Exercise 7
Maximize Z= 18x1 + 9x2
S.T: 24x1 + 8x2 60000
x1 2000
x2 6000
x1 , x2 0





The type of solution for this model is unique
[7] The range for optimality for ( ) is ....

(a) (b) (c) (d) none of these

[9] The range for optimality for (c1) is;


[11] If the value for (c1) reduced to be (15) and the value for the (c2) increased to (10) simultaneously, then the optimum solution will be; -----
(a) changed (b) unchanged (c) optimum (d) none of these
[12] If the value for (c1) increased by 50% and the value for the (c2) decreased by 50%, then the optimum solution will be; -------
[13] If the value for (c1) and ( ) are increased by 5 simultaneously. then the optimum solution -----
[14] If the value for (c1) and (c2) are increased by 5%, then the optimum solution-------
[15] If the value increased to 30 and the other coefficient is kept constant at its present value, then the optimum solution-------
[16] The range of the feasibility for first constraint (24x1 + 8x2 60000 ) is
(a) (48000 , 96000) (b) (54000 , 90000) (c) (36000 , 48000 ) (d) none of these

[17] The change in Z that is corresponding to the feasibility range of the first constraint is
[18] The worth per unit for the first constraint---

(a) 0.75 (b) 0.25 (c) 0 (d) none of these
[19] If the capacity is increased from the present 60000 to 70000, then the optimum revenue-------
[20] The range of the feasibility for the second constraint (x1 2000) is
(a) (48000,96000) (b) (120, ) (c) (36000,48000) (d) none of these
[21] The change in Z that is corresponding to the feasibility range of the second constraint is
[22] The worth per unit for the second constraint is

(a) 0.75 (b) 0.25 (c) 3 (d) 0
[23] The range of the feasibility for the third constraint (x2 6000) is
(a) (8000,9000) (b) (500 , ) (c) (1500 & 7500) (d) none of these
[24] The change in Z that is corresponding to the feasibility range of the third constraint is
[25] The worth per unit for the third constraint is

[26] If the capacity is decreased from the present 6000 to 5500, then the optimum revenue-------
[27] If we can increase one of the capacities , which should receive higher priority?
[28] To determine the accepted or rejected space for each constraint we use ….... point
(a) reference (b) minimum (c) maximum (d) none of these

Answers (Exercise 7)
Consider the following linear programming graphically.
Max. Z = 18X1 + 9X2
S.T 24X1 + 8X2 60000 ( )
X1 2000 ( )
X2 6000 ( )
X1, X2 0
Solution:
 24X1 + 8X2 60000
G
24X1 + 8X2 = 60000 (0,7500) (2500,0)
 X1 2000
X1 = 2000 vertical line passing through (2000, 0 )
 X2 6000
X2 = 6000 horizontal line passing through (0,6000)
 To find corner [D], Solve the 1st and 3rd equations algebraically.
24X1 + 8X2 =60000
X2 = 6000
Replace = 6000 in the first equation 24X1 + 8(6000) = 60000 x1 = 500 Then the corner D = (500,6000)
 To find corner [C], Solve the 1st and 2nd equations algebraically.
24X1 + 8X2 =60000
X1 = 2000
Replace = 2000 in the first equation 24(2000) + 8X2 =60000 x2= 1500 Then the corner c = (2000,1500)

Corner points: Z = 18x1 + 9x2
A = (0,0) Z = 18(0) + 9(0) = 0

B = (2000,0) Z = 18(2000) + 9(0) = 36000
C = (2000,1500) Z = 18(2000) + 9(1500) = 49500
D = (500,6000) Z = 18(500) + 9(6000) = 63000
E = (0,6000) Z = 18(0) + 9(6000) = 54000
Ans. (4,5)
The optimal solution at corner D: X1 = 500 X2 = 6000 Z = 63000
Ans. (7,8,9,10)
The two binding constraints are 24X1 + 8X2 60000 and X2 6000
(Range of optimality )
Ans. (11)
If the value for (c1) reduced to be (15) and the value for the (c2) increased to (10) simultaneously
 New C1 = 15
 New C2 = 10

 The new ratio = falls inside the range of optimality , then the optimal solution unchanged.
Ans. (12)
If the value for (c1) increased by 50% and the value for the (c2) decreased by 50%
 New C1 = 18 ( )= 27
 New C2 = 9 ( )= 4.5
 The new ratio = falls outside the range of optimality , then the optimal solution changed.
Ans. (13)
If the value for (c1) and ( ) are increased by 5 simultaneously. then the optimum solution -----
 New C1 = 18 +5 =23
 New C2 = 9 + 5 = 14
Ans. (14)
If the value for (c1) and (c2) are increased by 5%, then the optimum solution-------
 New C1 = 18 ( )=18.9
 New C2 = 9 ( )=9.45
Ans. (15)
 New C1 = 30
 New C2 = 9
Ans. (16,17,18)
We note that the end points E=(0, 6000) and F=(2000,6000) delineate the feasibility range for M1.
24X1 + 8X2 = M1 Z = 18X1 + 9X2
M1|E 24(0) + 8(6000) = 48000
Z|E =18(0)+9(6000)=54000
M1|F 24(2000) + 8(6000) = 96000
Z|F=18(2000)+9(6000)=90000
48000 96000
54000 90000
Y= = 0.75
Ans. (19)
The dual price for production capacity M1 is $0.75 and it is applicable in the range 48000 96000. The proposed increase
to 70000 falls within the feasibility range. Hence, the increase in the optimum z = 0.75 (70000 60000) = 7500 which means
that the new optimum z = 63000 +7500 = 70500
Ans. (23,24,25)
We note that the end points C=(2000, 1500) and H=(0,7500) delineate the feasibility range for M3.
X2 Z = 18X1 + 9X2
M3|C = 1500 Z|C =18(2000)+9(1500) = 49500
M3|H = 7500 Z|H=18(0)+9(7500) = 67500
1500 7500 49500 67500
Y= 3
Ans. (26)
The dual price for production capacity M3 is $3 and it is applicable in the range 1500 7500. The proposed decreasing to
5500 falls within the feasibility range. Hence, the decrease in the optimum z = 3 (6000 5500) = 1500 which means that the new
optimum z = 63000 1500 = 61500

Exercise: 8
Maximize Z = 8x1 + 5x2
2x1 + x2 400 ( : production capacity of the first constraint)
X1 150 ( : production capacity of the second constraint)
X2 200 ( : production capacity of the third constraint)
x1, x2 0


(a) 5 (b) 4 (c) Infinite (d) None of these

[4] The point (40,80) is ----

(a) Feasible (b) Infeasible (c) Optimal (d) none of these
The point (40,80) is feasible solution because it lies in feasible solutions space and satisfies all constraint but it is not optimal.
[5] The point (150,200) is ------

(a) Feasible (b) Infeasible (c) Optimal (d) none of these
The point (150,200) is infeasible solution because it lies outside the feasible solutions space and doesn't satisfy all constraint.


The model has a unique solution.




[13] If the value for (c1) increased by 20% and the value for the (c2) decreased by 10%, then the optimum solution will be; -----
(a) changed (b) unchanged (c) infeasible (d) none of these
[14] If C1 and C2 are each reduced by 15 percent, then the optimum solution will be; -----
[15] If C1 and C2 are changed to be the same, then the optimum solution will be; -----
[16] Suppose that is fixed at its current value of and the value of changed to $6: then the optimum solution will be; -----

[17] The range of the feasibility for first constraint (2x1 + x2 400) is
(a) 200 500 (b) 400 900 (c) 360 400 (d) none of these
[19] The worth per unit for the first constraint is

[20] By how much could the capacity of the first constraint increased while the unit worth is applicable?
[21] By how much could the capacity of the first constraint decreased while the unit worth is applicable?
[22] If the production capacity (RHS of the first constraint) decreased to 350, then the new optimal solution -------
[23] The range of the feasibility for the second constraint (X1 150 ) is
(a) (4800 9600) (b) (5400 9000) (c) (3600 4800 ) (d) none of these

(a) 0.75 (b) 0.25 (c) 4 (d) 0
[26] The range of the feasibility for the third constraint (X2 200) is
(a) (100,400) (b) (500 , ) (c) (350 & 600) (d) none of these
[27] The change in Z that is corresponding to the feasibility range of the third constraint is

[29] By how much could the capacity of the third constraint increased while the unit worth is applicable?
[30] If the production capacity (RHS of the third constraint) increased by 100, then the new optimal solution -------

Maximize Z = 8x1 + 5x2
2x1 + x2 400 ( : production capacity of the first constraint)
X1 150 ( : production capacity of the second constraint)
X2 200 ( : production capacity of the third constraint)
x1, x2 0
Answer
G
 2X1 + x2 = 400
X1 = 0 X2 = 400 (0,400)
X1 = 200 , X2 = 0 (200,0)
 X1 = 150 vertical line

(150,0) and (150,200)
F
 X2 = 200 horizontal line

(0,200) and (100,200)

Corner points Max: Z = 8X1 + 5X2
A = (0,0) = 8(0) + 5(0) =0
B = (150,0) = 8(150) + 5(0) = 1200
C = (150,100) = 8(150) + 5(100) = 1700
D = (100,200) = 8(100) + 5(200) = 1800
E = (0,200) = (0) + 5(200) = 1000
Ans. (6,7)
The optimal solution is at corner D X1 = 100 X2 = 200 Z = $1800
Ans. (9,10,11, and 12)

The two binding constraints are The first constraint: 2X1 + X2 = 400 and The third constraint: X2 = 200
Range of optimality
Range of optimality
Range of optimality
Range of optimality
Ans. (13)
 If the value of (c1) increased by 20% this means that becomes 120% of its current value, then The new C1 =(8) ( ) = $ 9.6
 If the value of (c2) decreased by 10% this means that becomes 90% of its current value, then the new C2= (5) ( ) = $4.5
Ans. (14)
 The new value of C1 after reducing it by 15% = (8) ( ) = $ 6.8

 the new value of C2 after reducing it by 15% = (5) ( ) = $4.25

Ans. (15)
If C1 and C2 are changed to be the same
 Let the new C1 = a
 Let the new C2 = a
Ans. (16)
 C1 =8
 The new C2 = 6
Ans. (17,18,19)
The end points E = (0,200) and F = (150,200) delineate the feasibility range of the first constraint.
2X1 + X2 = M1 Z = 8X1 + 5X2

M1|E 2(0) + 200 = 200 Z|E = 8(0) + 5(200) = 1000
M1|F 2(150) + 200 = 500 Z|F = 8(150) + 5(200) = 2200
200 M1 500 1000 Z 2200
Unit worth per unit of the resource of the first constraint Y= =4

Ans. (20)
Maximum increase in = 500-400 = 100
Ans. (21)
Maximum decrease in = 400-200 = 200
Ans. (22)
The dual price for production capacity M1 is $4 and it is applicable in the range (200, 500). The proposed decrease to 350 falls
within the feasibility range. Hence, the decrease in the optimum z = 4(400 350) = $200. Which means that the new optimum
z = 1800 200 = 1600
Ans. (26,27,28)
Range of feasibility for the third constraint
[d] The end points C = (150,100) and G = (0,400) delineate the feasibility range of the third constraint
X2 = M3 Z = 8X1 + 5X2
M3|C X2 = 100 Z|C = 8(150) + 5(100) = 1700
M3|G X2 = 400 Z|G = 8(0) + 5(400) = 2000
100 M3 400 1700 2000
* Unit worth per resource = =1
Ans. (29)
Maximum increase in = 400 – 200 = 200
Ans. (30)
The dual price for production capacity M3 is $1 and it is applicable in the range (100, 400). The proposed increased by 100 means
increased to 300 which falls within the feasibility range. Hence, the increased in the optimum Z = 1(100) = $100. Which
means that the new optimum Z = 1800 + 100 = $1900

Exercise 9
Maximize Z= 8x1 + 12 x2
S.T: 20x1 + 60x2 1500
70x1 + 60x2 2000
12x1 + 4x2 300
x1 , x2 0


[3] The solution space shape has …... corner points

(a) (21,12) (b) (12,21) (c) (21.28, 9.55) (d) none of these


The type of solution for this model is unique




[11] If the value for (c1) reduced to be (5) and the value for the (c2) increased to (20) simultaneously, then the optimum solution will be; -----
[12] If the value increased by 60% and the other coefficient is kept constant at its present value, then the optimum solution-------
[13] The range of the feasibility for first constraint (20x1 + 60x2 ) is
(a) 1009.4 2100 (b) 289.16 420 (c) 1500 4800 (d) none of these
(a) 540 Z 900.25 (b) 289.16 Z 420 (c) 320 Z 456 (d) none of these
[15] The worth per unit for the first constraint---

(a) 0.16 (b) 0.19 (c) 0.12 (d) none of these
[16] If the capacity is increased by 100, then the optimum value of z is increased by -------

[17] The range of the feasibility for the second constraint (70x1 + 60x2 ) is
(a) 2600.1 M2 3937.5 (b) 1960.2 M2 2400.9 (c) 1500 M2 2437.5 (d) none of these
(a) 366 Z 750 (b) 300 Z 375 (c) 220 Z 540 (d) none of these

(a) 0.75 (b) 0.25 (c) 3 (d) 0.08
[20] The range of the feasibility for the third constraint (12x1 + 4x2 ) is
(a) 2600.1 M3 3937.5 (b) 1960.2 M3 2400.9 (c) 1500 M3 2437.5 (d) none of these
(a) 2200 Z 2100 (b) 0 (c) 2200 Z 5400 (d) none of these

(a) 0.75 (b) 0.25 (c) 3 (d) 0
[23] If we can increase one of the capacities , which should receive higher priority?

Maximize Z= 8x1 + 12 x2
S.T:
20x1 + 60x2 1500 ( : production capacity of the first constraint)
70x1 + 60x2 2100 ( : production capacity of the second constraint)
12x1 + 4x2 300 ( : production capacity of the third constraint)
x1 , x2 0
Answer
 20x1 +60x2 = 1500

x1 = 0 x2 = 25 (0,25)
x1 = 75 , x2 = 0 (75,0)
 70 x1 + 60x2 = 2100
x1 = 0 x2 = 25 (0,35)
x1 = 30 , x2 = 0 (30,0)
 12x1 + 4x2 = 300

x1 = 0 x2 = 75 (0,75)
x1 = 25 , x2 = 0 (25,0)
The corners that delineate the feasible solution space.

 Corner A (0,0)
 Corner B (25,0)
 Corner E (0,25)
 To find corner [C], Solve the 2nd and 3rd equations algebraically.
70 x1 + 60x2 = 2100 70 x1 + 60x2 = 2100 by subtraction
12x1 + 4x2 = 300 Mult (15) 180x1 + 60x2 = 4500
-110x1 = -2400 or
Replace = in the first equation 70 ( ) + 60x2 = 2100 x2 = or 9.55 Then the corner C = ( ) ( )
 To find corner [D], Solve the 1st and 2nd equations algebraically.
20x1 60x2 = 1500 by subtraction
70x1 60x2 = 2100
12
Replace = 12 in the first equation 20(12) 60x2 = 1500 x2 = 21 Then the corner D = (12,21)

Corner points Max: Z= 8x1 + 12 x2
A = (0,0) = 8(0) + 12 (0) = 0
B = (25,0) = 8(25) +12 (0) = 200
C=( ) = 8( ) +12( ) =289.16
D = (12,21) = 8(12) + 12(21) = 348
E = (0,25) = 8(0) + 12 (25) = 300
Ans. (4,5)
The optimal solution is at corner D X1 = 12 X2 = 21 Z = 348
Ans. (7,8,9, and 10)

 The two binding constraints are The first constraint: 20x1 +60x2 = 1500 and The second constraint: 70x1+60x2 =2100
 Range of optimality
Ans. (11)
 The new C1 = 5
 The new C2 = 20

 The new ratio = falls outside the range of optimality or then the optimal solution changed.
Ans. (12)
 The new value of C1 after increasing it by 60% = (8) ( ) = 12.8
 C2 = 12
Ans. (13,14,15)
The end points C ( ) and F (0,35) delineate the feasibility range of the first constraint
20X1 + 60X2 = M1 Z = 8X1 + 12X2

M1|C 20( ) +60( )= 1009.4 Z|C = 8( ) + 12( ) = 289.16
M1|F 20(0) + 60(35) = 2100 Z|F = 8(0) + 12(35) = 420
1009. 4 M1 2100 289.16 Z 420
Unit worth per unit of the resource of the first constraint Y = = 0.12
Ans. (16)
The dual price for production capacity M1 is 0.12 and it is applicable in the range (1009. 4, 2100). The proposed increased by 100 means that
increased to 1600 which falls within the feasibility range. Hence, the increase in the optimum = 0.12(100) = 12.
Ans. (17,18,19)
Range of feasibility for the second constraint
The end points E ( ) and G (18.75, 18.75) delineate the feasibility range of the second constraint
70X1 + 60X2 = M1 Z = 8X1 + 12X2
M2|E 70( ) +60( ) = 1500 Z|E = 8( ) + 12( ) = 300
M2|G 70(18.75) + 60(18.75) = 2437.5 Z|G = 8(18.75) + 12(18.75) = 375
1500 M2 2437.5 300 Z 375
* Unit worth per resource = = 0.08

Ans. (20,21,22)
Range of feasibility for the third constraint
rd
Note that the 3 constraint is a non-binding
12X1 + 4X2 = M3 Change of z is zero
M3|D 12( ) + 4( ) = 228
228 M3
* Unit worth per resource =

Exercise: 10
Min Z = 8X1 + 6X
S.T
X1 + X2 20
5 X1 12
6 X2 10
X1, X2 0
[1] Determine the optimal solution graphically.
[2] The range of feasibility and the unit worth per unit for the right hand side of (X1 + X2 ).
[3] The range of feasibility and the unit worth per unit for the right hand side of the (X2 10).
Answer:
[1]
Min Z = 8X1 + 6X2
S.T
X1 + X2 20 X1 + X2 20
X1 5
5 X1 12 X1 12
6 X2 10 X 2 6
X2 10
X1, X2 0 X1, X2 0
 X1 + X2 20
X1 + X2 = 20
X1 = 0  X2 = 20 (0,20)
X1 = 20  X2 = 0 (20,0)
 X1 5
X1 = 5 vertical
(5,0), (5,2) E
 X1 12
X1 = 12 vertical D
(12,0), (12,6)
 X2 6
X2 = 6 horizontal
(0,6), (2,6),
 X2 10
X2 = 10 horizontal
(0,10), (2,10)
Corner points Min Z = 8X1 + 6X2

A = (12, 8 ) = 8(12) + 6(8) = 144
B = (12,10) = 8(12) + 6(10) = 156
C = (10,10) = 8(10) + 6(10) = 140
The optimal solution is
Corner C X1 = 10 X2 = 10 Z = 140
[2] The end points B = (12,10) and D = (5,10) delineate the feasibility range for M1.
X1 + X2 = M1 Z = 8X1 + 6X2
M1|B = 12 + 10 = 22 Z|B = 8(12) + 6(10) = 156
M1|D = 5 + 10 = 15 Z|D = 8(5) + 6(10) = 100
15 22
Unit worth per unit for y1 = =8
This means that a 1-unit change in M1 in the range will change the optimum value of z by 8.
[3] The end points E = (5,15) and A = (12, 8) delineate the feasibility range for M5.
X2 = M5 Z = 8X1 + 6X2
M5|E = 15 Z|E = 8(5) + 6(15) = 130
M5|A = 8 Z|A = 8(12) + 6(8) = 144
8 15
Unit worth per unit for y1 = =
This means that a 1-unit change in M5 in the range will change the optimum value of z by .

Exercise: 11
Consider the following LP model:
Max. Z = 3X1 – X2
S.t: X1 + 2X2 6
X1 – X2 2
X2 2
X1, X2 0
a) Use the graphical solution to determine the optimal solution.
b) The worth per unit change in the availability amount of R.H.S of the first constraint.
Answers:
[a]
a]
* X1 + 2X2 6
X1 + 2X2 = 6
When X1 = 0  X2 = 3 (0,3)
When X1 = 6  X2 = 0 (6,0)
* X1 – X2 2
X1 – X2 = 2
When X1 = 0  X2 = -2 (0,-2)
When X1 = 2  X2 = 0 (2,0)
* X2 2
X2 = 2, horizontal line passing through ( 0,2)
 To find the point (c), solve the first and the second equations algebraically.
X1 + 2X2 = 6 X1 + 2X2 = 6
X1 - X2 = 2 by subtraction -X1 + X2 = - 2
3X2 = 4  X2 =
Replace X2 = in the first equation X1 + 2 ( ) = 6  X1 =
Corner c ( )
 To find corner [D], Solve the 1st and 3nd equations algebraically.
X1 + 2X2 =6
X2 = 2
Replace X2= 2 in the first equation then, X1 + 2(2) =6 X1= 2 Then corner D = (2,2)
Determination of the optimal solution:

Corner points Max Z = 3X1 – X2
A = (0,0)  Z = 3(0) – 0 = 0
B = (2,0)  Z = 3(2) – 0 = 6
C=( )  Z = 3( ) =
D = (2,2)  Z = 3(2) – 2 = 4
E = (0,2)  Z = 3(0) – 2 = -2
The optimal solution is at corner C = ( )
X1 = X2 = Z=
[b]
We note that the end points B =(2,0) and F=(4,2) delineate the feasibility range for the R.h.s. of the first
constraint.
X1 + 2X2 = M1 Z = 3X1 - X2
M1|B 2 + 2(0) = 2 Z|B = 3(2) 0 = 6
M1|F 4 + 2(2) = 8 Z|F = 3(4) 1(2) = 10
2 8 6 10
The unit worth per unit of the first constraint =

Exercise: 12
Max Z = 5X1 + 7X2
S.T X1 + X2 500
– 2X1 + X2 0
X1 100
X1, X2 0
[2] Determine the range of optimality that will keep the optimum unchanged.
Answer
[1]
 X1 + X2 500
X1 + X2 = 500
X1 = 0  X2 = 500 (0, 500)
X1 = 500  X2 = 0 (500, 0)
 – 2X1 + X2 0
– 2X1 + X2 0
X1 = 0  X2 = 0 (0, 0)
X1 = 100  X2 = 200 (100, 200)
 X1 100
X1 = 100
(100,0) (100,100)

Corner points Max Z = 5X1 + 7X2
A = (100,200) Z = 5(100) + 7(200) = 1900
B = (166.6, 333.4) Z = 5(166.6) + 7(333.4) = 3166.8
C = (100,400) Z = 5(100) + 7(400) = 3300
The optimal solution is

X1 = 100 X2 = 400 Z = 3300
[2] The two binding constraints are X1 + X2 500 and X1 100

The range of optimality 1

Exercise: 13
Max: Z = 100X1 + 140X2

S.T 0.5X1 + X2 180
X1 200
X2 150
X1, X2 0
[2] Determine the range of optimality that will keep the optimum unchanged.
[3] If the present C1 and C2 are increased by 25%, use sensitivity analysis to determine whether or not the solution will
change.
[4] If the present C1 and C2 are reduced to $80 and $110, respectively. Use sensitivity analysis to determine whether or
not the solution will change.
st
[5] The range of feasibility and the unit worth per unit for the right hand side of the 1 constraint.
nd
[6] The range of feasibility and the unit worth per unit for the right hand side of the 2 constraint.
Answer
[1]
 0.5X1 + X2 = 180
X1 = 0  X2 = 180 (0,180)
X1 = 360  X2 = 0 (360,0)
 X1 = 200 Vertical line

(200,0) (200,200)
 X2 = 15 horizontal line
(0,150) (100,150)
Corner points Max Z = 100X1 + 140X2

A = (0,0) = 100(0) + 140(0) = 0
B = (200,0) = 100(200) + 140(0) = 20000
C = (200,80) = 100(200) + 140(80) = 31200
D = (60,150) = 100(60) + 140(150) = 27000
E = (0,150) = 100(0) + 140(150) = 21000
The optimal is X1 = 200 X2 = 80 Z = $31200

[2] The two binding constraints are 0.5X1 + X2 180 and X1 200
( )
[3] The new ratio of = falls inside the range of optimality 0 2, then the optimal solution unchanged.
( )
[4] The new ratio  = 1.375 falls inside the range of optimality 0 2, then the optimal solution unchanged.
[5] The end points B = (200, 0) and F = (200,150) delineate the feasibility range for M1.
0.5X1 + X2 = M1 Z = 100X1 + 140X2
M1|B = ( ) Z|B = 100(200) + 140(0)= 20000
M1|F = ( ) Z|F = 100(200) + 140(150)= 41000
Unit worth per unit for y1 =
[6] The end points G = (360, 0) and D = (60,150) delineate the feasibility range for M2.
X1 = M2 Z = 100X1 + 140X2
M2|G = 360 Z|G = 100(360) + 140(0) = 36000
M2|D = 60 Z|D = 100(60) + 140(150) = 27000
Unit worth per unit for y1 = = 30

Exercise: 14
Min Z = 10X1 + 4.5X2
S.T
2X1 + 3 X2 35
6X1+ 2X2 70
X1, X2 0
Determine the optimal solution graphically.
Answer
2X1 + 3 X2 35
X1 = 0 X2 = 11.67
X1 = 17.5 X2 = 0
6X1+ 2X2 70
X1 = 0 X2 = 35
X1 =11.67 X2 = 0
Corner points Min Z = 10X1 + 4.5X2

A = (17.5,0) = 10(3.5) + 4.5(0) = 35
B = (10,5) = 10(10) + 4.5(5) = 122.5
C = (0,35) = 10(0) + 4.5(35) = 157.5
The optimal solution is X1 = 10 X2 = 5 Z = 122.5
This case is not a special case because z is bounded
Exercise: 15
Min Z = 12X1 + 10X2
S.T
3X1 + 5 X2 7
2X1+ X2 7
X1, X2 0
Determine the optimal solution graphically.
Answer
3X1 + 5 X2 7
X1 = 0 X2 = 1.4
X1 = 2.33 X2 = 0
2X1+ X2 7
X1 = 0 X2 = 7
X1 = 3.5 X2 = 0
Corner points Min Z = 12X1 + 10X2

A = (3.5,0) = 12(3.5) + 10(0) = 42
B = (0,7) = 12(0) + 10(7) = 70
The optimal solution is X1 = 3.5 X2 = 0 Z = 42
This case is not a special case because z is bounded

Final Revision Part 1 Or-2024 New

Uploaded by

Copyright:

Available Formats

You might also like

Final Revision Part 1 Or-2024 New

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

Final Revision Part 1 Or-2024 New

Uploaded by

Copyright:

Available Formats

Operations Research

[3] In general, any OR model consists of ---- components.

[6] A solution of the model is …….., if it satisfies all the constraints.

[9] There are ----- principal phases for implementing OR in practice.

[13] Problem ------------ should be carried out by the entire OR team.

Mahmoud Soliman 01 22 22 47 596

[23] LP model with inconsistent constraints have ………. solution.

[24] The special case, where there is no feasible solution is called--------solution.

[27] A linear programming model as any OR model consists of------ components

[29] In ------------- the functions of the model are nonlinear.

[30] In ------------- the variables assume integer values.

[32] In ------------- the problem can be modeled as a network.

Mahmoud Soliman 01 22 22 47 596

[38] Calculating the range of ------------helps in studying the changes in constraints.

[40] The region represented by is:

True & false

List the principal phases for implementing OR in practice?

Mahmoud Soliman 01 22 22 47 596

[7] The type of solution for this model is;

Mahmoud Soliman 01 22 22 47 596

The determination of optimal solution:

Comment: This is a special case of liner programming (Degenerate solution)

Mahmoud Soliman 01 22 22 47 596

[1] The number of structural constraints is

[2] The solution space has …... corner points

[4] The solution space for this model is

[5] The optimum solution for this model is

[6] Is there any redundant constraint?

[7] If there is a redundant constraint, which one is it?

[8] The type of solution for this model is…..

Mahmoud Soliman 01 22 22 47 596

[1] The number of the structural constraints is

[2] The solution space has …... corner points

[4] The optimum solution for this model is

[5] The type of solution for this model is;

 The solution space is unbounded.

Mahmoud Soliman 01 22 22 47 596

To determine corner C, we solve:

Mahmoud Soliman 01 22 22 47 596

[3] The optimum solution for this model is

[4] The type of solution for this model is

[5] The special case, where there is no feasible solution is called--------solution.

[6] LP model with inconsistent constraints has ………. solution.

 The solution is infeasible.

Mahmoud Soliman 01 22 22 47 596

[1] The number of the structural constraints is

[2] The number of feasible solutions is

[3] The solution space has …... corner points

[5] The optimum solution for this model is

[6] The type of solution for this model is

[7] The range for optimality for ( ) is ....

[8] The range for optimality for ( ) is ....

[9] The range for optimality for (c1) is;

[10] The range for optimality for (c2) is;

Mahmoud Soliman 01 22 22 47 596

[18] The worth per unit for the first constraint---

[22] The worth per unit for the second constraint is

[25] The worth per unit for the third constraint is