Professional Documents
Culture Documents
Home Work Questions
Home Work Questions
*3. Show algebraically that all the basic solutions of the following LP are infeasible.
Maximize z = x1+ x2
subject to
x1+ 2x2 6
2x1+ x2 16
Problem Set 3.3A
1. In Figure 3.3, suppose that the objective function is changed to Maximize z = 8x1+ 4x2
Identify the path of the simplex method and the basic and nonbasic variables that
definethis path.
2. Consider the graphical solution of the Reddy Mikks model given in Figure
2.2. Identifythe path of the simplex method and the basic and nonbasic
variables that define this path.
*3. Consider the three-dimensional LP solution space in Figure 3.4, whose feasible
extremepoints are A, B, ... , and 1.
(a) Which of the following pairs of corner points cannot represent successive
simplex iterations:
(A, B), (B, D), (E, H), and (A, I)? Explain the reason.
(b) Suppose that the simplex iterations start at A and that the optimum occurs at H.
Indicatewhether any of the following paths are not legitimate for the simplex algorithm,and
state the reason.
(i) A-B-G-H.
(ii) A-E-I-H.
(iii) A-C-E-B-A-D-G-H.
5. Consider the solution space in Figure 3.4, where the simplex algorithm starts at point
A.Determine the entering variable in the first iteration together with its value and the
improvementin z for each of the following objective functions:
*(a) Maximize z = x1 2x2 + 3x3
(b) Maximize z = 5x1 + 2x2 + 4x3
(c) Maximize z = -2x1 + 7x2 + 2x3
(d) Maximize z = x1 + x2 + x3
Problem Set 3.3B
2. Consider the following set of constraints:
x1+ 2x2 + 2x3 + 4x4 40
2x1 - x2 + X3 + 2x4 8
4x1 2x2 + x3 - x410
Solve the problem for each of the following objective functions.
(a) Maximize z = 2x1+ x2 3x3 + 5x4
(b) Maximize z = 8x1+ 6x2 + 3x3 2x4
(c) Maximize z = 3x1 - x2 + 3x3 + 4x4
xl x2x3
x4x5 x6x7x8
0 -5 04-1 -10 0 0620
x8
0 3 0 -2 -3 -1 5
x30 1 1 31 0 3 06
Solution
12
x11 -1006-40 0 0
(a) Categorize the variables as basic and nonbasic and provide the current values of allthe
variables.
*(b)Assuming that the problem is of the maximization type, identify the nonbasic
variablesthat have the potential to improve the value of z. If each such variable entersthe
basic solution, determine the associated leaving variable, if any, and the associatedchange
in z. Do not use the Gauss-Jordan row operations.
(c) Repeat part (b) assuming that the problem is of the minimization type.
(d) Which nonbasic variable(s) will not cause a change in the value of Z when selected to
enter the solution?
AFTER MID
PROBLEM SET #3.4(a)
3. In Example 3.4-1, identify the starting tableau for each of the following (independent)
cases, and develop the associated z-row after substituting out all the artificial variables:
*(a) The third constraint is Xl + 2X2 >= 4.
*(b) The second constraint is 4XI + 3X2 <= 6.
(c) The second constraint is 4XI + 3X2 = 6.
(d) The objective function is to maximize z = 4xI + x2
7. Solve the following problem using X3 and X4 as starting basic feasible variables. As in
Problem 6, do not use any artificial variables.
Minimize z = 3xI + 2X2 + 3X3
subject to
XI + 4X2 + X3 >=7
2x1 + X2 + X4 >= 10
Xl> x2, x3, X4 >= 0
solutions.
Maximize z =: Xl + 2X2 + 3X3
subject to
Xl + 2x2 + 3X3 <= 10
XI + x2 <=5
Xl <=1
X1,x2,x3>=0
Note: Although the problem has more than three alternative basic solution optima,
you are only required to identify three of them. You may use TORA for
convenience.
2. Solve the following LP:
Maximize z = 2Xl - X2 + 3X3
subject to
Xl - X2 + 5X3 <=10
2Xl - X2 + 3x3 <= 40
X1,x2,x3>=0
From the optimal tableau, show that all the alternative optima are not corner points
(i.e., nonbasic). Give a two-dimensional graphical demonstration of the type of solution
space and objective function that will produce this result. (You may use TORA
for convenience.)
3. For the following LP, show that the optimal solution is degenerate and that none of the
alternative solutions are corner points (you may use TORA for convenience).
Maximize z = 3XI + Xl
subject to
Xl + 2X2 <= 5
Xl + X2 - x3 <= 2
7XI + 3X2 - 5X3 <=20
X1,x2,x3>=0
PROBLEM SET 3.5 ( C )
1. TORA Experiment. Solve Example 3.5-3 using TORA's Iterations option and show that
even though the solution starts with Xl as the entering variable (per the optimality
condition),
the simplex algorithm will point eventually to an unbounded solution.
*2. Consider the LP:
Maximize z = 20XI + lOx2 + X3
subject to
3Xl - 3X2 + 5X3 <=50
Xl + x3<= 10
Xl - X2 + 4x3 <= 20
X1,x2,x3>=0
(a) By inspecting the constraints, determine the direction (XI. X2, or X3) in which the
solution
space is unbounded.
(b) Without further computations, what can you conclude regarding the optimum objective
value?
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Q.No. Solve the following assignment problem using Hungarian Algorithm in order to
maximize the efficiency.
J-1
J-2
J-3
J-4
J-5
M-1
10
12
M-2
14
16
11
M-3
M-4
11
M-5
12
*4. Consider eight equal squares arranged in three rows, with two squares in the first row,
fOUT in
the second, and two in the third.The squares of each row are arranged symmetrically about
the vertical axis. It is desired to fill the squares with distinct numbers in the range 1
through 8 so that no two adjacent vertical, horizontal, or diagonal squares hold consecutive
numbers.
Use some form of a network representation to find the solution in a systematic way.
5. Three inmates escorted by 3 guards must be transported by boat from the mainland to a
penitentiary island to serve their sentences. The boat cannot transfer more than two
persons in either direction.The inmates are certain to overpower the guards if they
outnumber them at any time. Develop a network model that designs the boat trips in a
manner that ensures a smooth transfer of the inmates.
PROBLEM SET 6.2(a)
EXAMPLE 6.2-1
1) Solve Example 6.2-1 starting at node 5 (instead of node 1), and show that the
algorithm
produces the same solution.
2) Determine the minimal spanning tree of the network of Example 6.2-1 under each of
the
following separate conditions:
*(a) Nodes 5 and 6 are linked by a 2-mile cable.
(b) Nodes 2 and 5 cannot be linked.
(c) Nodes 2 and 6 are linked by a 4-mile cable
(d) The cable between nodes 1 and 2 is 8 miles long.
(e) Nodes 3 and 5 are linked by a 2-mile cable.
(f) Node 2 cannot be linked directly to nodes 3 and 5.
7. A company is in the process of preparing a budget for launching a new product. The
following table provides the associated activities and their durations. Construct the project
network.
8. The activities involved in a candlelight choir service are listed in the following table.
Construct the project network.
9. The widening of a road section requires relocating ("reconductoring") 1700 feet of 13.8kV
overhead primary line. The following table summarizes the activities of the project.
Construct the associated project network.
1O. The following table gives the activities for buying a new car. Construct the project
network.