Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 7, Problem 10RP

Explanation of Solution

Optimal solution:

  • Using u-v method, the first step is to check whether the solution is optimal or not.
  • The table is shown below:
424
1284
  • The first step is to find the initial feasible solution.
  • It is found using Vogels App method.
  • In order to find the feasible solution, the first step is to find the difference between the two least cost cells which have not been allocated for both rows and columns.
  • The next step is to select the largest of the differences of both the rows and columns and if there is a tie, the one with the maximum quantity is considered.
  • The next step is to assign the largest quantity within the demand in that row or column where the cost is minimum.
  • Then the last step is to eliminate the entire row or column.
  • The cost value of cells is represented bycij.
  • Hence, c11 is 10, c12is 5, c22is 5 and c23 is 10.
  • In this method, the value uiand vj belongs to rows and columns respectively.
  • The formula to find ui and vj is as follows:

    ui+ vj= cij = m + n – 1 = 3 + 2 – 1 = 4

  • Here, mis the total number of rows and nis the total number of columns and cijis the cost value

Blurred answer
Students have asked these similar questions
1-)a.Find the starting solution of this transportation model by Least Cost Method. (Unit transportation costs are given in the table) 2-)Then find the optimal solution of this transportation model by Stepping Stone Method. D1 D2 D3 D4 Supply M1 16 24 14 11 25 M2 21 18 17 9 30 M3 15 13 21 14 40 Demand 25 25 20 25
Why is it that each LP with an optimum solution also has an optimal fundamental viable solution to the problem?
A book salesperson living in New York needs to visit clients in Utah, Jersey, LA, and Milan within a month. The distances between these cities are given in the table in the picture. Find the optimal solution to the problem using the branch-and-bound method.
Knowledge Booster
Background pattern image
Computer Science
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.
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole