Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 4.12, Problem 2P
Explanation of Solution
Solving the LP using Big M method:
Given,
Subject to,
Introduce slack variables S1, S2 of cost coefficients zero each, surplus variable S3 and artificial variable A1 of cost coefficient Big M
After introducing slack variables, the LP problem becomes,
Subject to
Iteration 1:
-3 | 1 | 0 | 0 | -M | ||||
B |
CB |
XB |
Min Ratio | |||||
A1 | M | 4 | 2 | 1 | -1 | 0 | 1 | |
S1 | 0 | 1 | -1 | 1 | 0 | 1 | 0 | |
Z=0 | 2M | M | -M | 0 | M | |||
-2M+2 | -M+3 | M | 0 | 0 |
Negative minimum
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Q1: For these Value Obtain U and V and evaluate W when
Z = V5 – 2i
Q2: If
Z1= 4i-3
Z2= 3i
Z1+Z2
Find
Z2
(2x² x 2 2
Q3: if f(x) =
4
x < 2
find
f(x)dx
Q4: Show that f (z) = 2z3 – 4z + 1 is satisfy Cauch-Rieman
%3D
if Z in Cartesian form
Sample Solution
Q: Operations/Cost Freq.
for (int i=1; i<=n; ++i) = c1 n+1
display (i) = c2 n
T(n) = c1(n+1) + c2(n) = (c1+c2) (n) + c1 = c(n) + c1
Calculate T(n) for Question 1.
Question 1:
Operations/Cost Freq.
for (int i=1; i<=n; ++i) = ? ?
{
display (i) = ? ?
}
for (int j=1; j<=n; ++j) = ? ?
{
display (j) = ? ?
}
Solve the following modular equations. In each case please use the smallest positive solution.
a) 4 + x = 9 mod 15
X =
b) 2x + 1 = 6 mod 5
X =
c) 7* = 9 mod 10
X =
Chapter 4 Solutions
Operations Research : Applications and Algorithms
Ch. 4.1 - Prob. 1PCh. 4.1 - Prob. 2PCh. 4.1 - Prob. 3PCh. 4.4 - Prob. 1PCh. 4.4 - Prob. 2PCh. 4.4 - Prob. 3PCh. 4.4 - Prob. 4PCh. 4.4 - Prob. 5PCh. 4.4 - Prob. 6PCh. 4.4 - Prob. 7P
Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Which of the following algorithms can be used to find the optimal solution of an ILP?(a) Enumeration method;(b) Branch and bound method;(c) Cutting plan method;(d) Approximation method.arrow_forwardThe initial tableau of a linear programming problem is given. Use the simplex method to solve the problem. X2 X3 6 2 1 2 - 1 - 3 X1 1 3 -5 S₁ 1 0 0 S2 0 1 0 Z 0 0 1 18 39 The maximum is | when x₁ = ₁X₂ = ₁ x3 =₁ $₁=₁ and $₂ = - X3 (Type integers or simplified fractions.)arrow_forward7 Maximize z = 5x₁ + 4x₂ subject to 6x₁ + 4x₂ ≤ 24 X₁ + 2x₂ ≤6 -X₁ + X₂ ≤1 X₂ ≤2 X₁, X₂ ≥ 0 Solve the following linear program using the simplex method.arrow_forward
- A construction company has four large bulldozers located at four different garages. The bulldozers are to be moved to four different construction sites. The distances in miles between the bulldozers and the construction sites are given below. Bulldozer/ A B C D Site Students 1 90 75 75 80 solve it 2 35 85 55 65 yourself 3 125 95 90 105 4 45 110 95 115 How should the bulldozers be moved to the construction sites in order to minimize the total distance traveled?arrow_forwardby using the (graphical method) find the optimum solution of X1, X2 that the maximum Z=10X1+25X2 subject into constrain below: 4X1+2X2 s12 3X1+X2 s 15 X1, X220arrow_forward3 2: Solve the following linear program using the simplex method. Maximize z = 5x₁ + 4x₂ subject to 6x₁ + 4x₂ ≤ 24 X₁ + 2x₂ ≤6 -X₁ + X₂ ≤1 X₂ ≤2 X₁, X₂ ≥ 0arrow_forward
- (a) ged(24, 54) = 6 (b) gcd(18,42) = 6 Now you try some: Answers (c) gcd(244, 354) = 2 (d) gcd(128, 423) = 1 (e) gcd(2415, 3289) = 23 (f) ged(4278, 8602) = 46 (g) gcd(406, 555) = 1arrow_forwardQ6: Find the total cost of transportation for the following problem using the method of transportation is less cost. Quantity 2000 Quantity From To 2000 B 500 350 700 850 Cost Int. E F G A 2 5 B 4 9 4 On76arrow_forwardA B C D X1 a1 b1 c3 L X2 a2 b1 c1 L X3 a2 b2 c1 H X4 a2 b2 c2 H X5 a2 b1 c1 L X6 a2 b2 c1 H X7 a2 b1 c2 H X8 a1 b2 c2 L Using the table above, calculate the following, there measures (1) Kulczynski, (2) Lift, and (3) Cosine. a) A1 ==> L b) A2, B2 ==> H c) A2, C2 ==> Harrow_forward
- Please solve a,b, c, and d.arrow_forwardSolve the following system of equations by Gaussian elimination method. 2x1 − x2 + x3 = 1 4x1 + x2 − x3 = 5 x1 + x2 + x3 = 0arrow_forwardQ6: Find the total cost of transportation for the following problem using the method of transportation is less cost. From Quantity To Quantity A 2000 E 2000 B 500 F 350 C 700 G 850 --(20 marks) A B C Cost Int. F 1 3 E 2 4 9 ST G 5 7 6arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole