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 6.4, Problem 7P

Explanation of Solution

Optimal solution of the diet problem:

  • The LINDO output is considered for the Dakota problem:
  • max 60DSK+30TBLS+20CHRS
  • Subject to constraint
    • 8DSK+6TBLS+CHRS48
    • 4DSK+2TBLS+1.5CHRS20
    • 2DSK+1.5TBLS+0.5CHRS8
  • End
  • LP optimum is found at step 2
  • Objective function value: 90.000000
VariableValueReduced cost
DSK2.0000000.000000
TBLS0.0000005.000000
CHRS8.0000000.000000
RowSlack or SurplusDual prices
224.0000000.000000
30.00000010.000000
40.00000010.000000
  • Number of iterations= 2
  • The ranges in which the basis is unchanged:
VariableCurrent coefficientOBJ coefficient ranges allowable increaseAllowable decrease
DSK60.00000020.0000004.000000
TBLS30.0000005.000000Infinity
CHRS20.0000002.5000005.000000
RowCurrent RHSRight-hand side ranges allowable increaseAllowable decrease
248.000000Infinity24.000000
320.0000004.0000004.000000
48.0000002.0000001.333333
  • As brownies and pineapple cheesecake have no zero reduced costs, so case 2 is applied to the states where,
    • “At least one variable whose objective function coefficient is changed has a reduced cost of zero”.
  • In case 2 for each variable xj the ratio rj is defined as follows:
    • If Δcj0, then rj=ΔcjIj
    • If Δcj0, then rj=ΔcjDj
  • Here,
    • Δcj= Change in original objective function coefficient (cj) for xj
    • Ij= Maximum allowable increase in cj from LINDO output.
    • Dj= Maximum allowable decrease in cj from LINDO output.
  • The 100% rule for objective function states that,
    • “If rj1, then the current basis remains optimal”
    • Also,
    • “If rj>1, then the current basis may or may not be optimal”.
  • If the current basis remains optimal, the value of the decision variables remains unchanged, but the optimal z-value may change.
  • Now, the price of desk is increased to $65, the price of the table is decreased to $25 and the price of chair is decreased to $18

Blurred answer
Students have asked these similar questions
Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…
What did you find most interesting or surprising about the scientist Lavoiser?
1. Complete the routing table for R2 as per the table shown below when implementing RIP routing Protocol? (14 marks) 195.2.4.0 130.10.0.0 195.2.4.1 m1 130.10.0.2 mo R2 R3 130.10.0.1 195.2.5.1 195.2.5.0 195.2.5.2 195.2.6.1 195.2.6.0 m2 130.11.0.0 130.11.0.2 205.5.5.0 205.5.5.1 R4 130.11.0.1 205.5.6.1 205.5.6.0

Chapter 6 Solutions

Operations Research : Applications and Algorithms

Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.4 - Prob. 1PCh. 6.4 - Prob. 2PCh. 6.4 - Prob. 3PCh. 6.4 - Prob. 4PCh. 6.4 - Prob. 5PCh. 6.4 - Prob. 6PCh. 6.4 - Prob. 7PCh. 6.4 - Prob. 8PCh. 6.4 - Prob. 9PCh. 6.4 - Prob. 10PCh. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.5 - Prob. 1PCh. 6.5 - Find the duals of the following LPs: Ch. 6.5 - Prob. 3PCh. 6.5 - Prob. 4PCh. 6.5 - Prob. 5PCh. 6.5 - Prob. 6PCh. 6.6 - Prob. 1PCh. 6.6 - Prob. 2PCh. 6.7 - Prob. 1PCh. 6.7 - Prob. 2PCh. 6.7 - Prob. 3PCh. 6.7 - Prob. 4PCh. 6.7 - Prob. 5PCh. 6.7 - Prob. 6PCh. 6.7 - Prob. 7PCh. 6.7 - Prob. 8PCh. 6.7 - Prob. 9PCh. 6.8 - Prob. 1PCh. 6.8 - Prob. 2PCh. 6.8 - Prob. 3PCh. 6.8 - Prob. 4PCh. 6.8 - Prob. 5PCh. 6.8 - Prob. 6PCh. 6.8 - Prob. 8PCh. 6.8 - Prob. 9PCh. 6.8 - Prob. 10PCh. 6.8 - Prob. 11PCh. 6.9 - Prob. 1PCh. 6.9 - Prob. 2PCh. 6.9 - Prob. 3PCh. 6.10 - Prob. 1PCh. 6.10 - Prob. 2PCh. 6.10 - Prob. 3PCh. 6.11 - Prob. 1PCh. 6.11 - Prob. 3PCh. 6.11 - Prob. 4PCh. 6.12 - Prob. 5PCh. 6.12 - Prob. 6PCh. 6.12 - Prob. 7PCh. 6 - Prob. 1RPCh. 6 - Prob. 2RPCh. 6 - Prob. 3RPCh. 6 - Prob. 4RPCh. 6 - Prob. 5RPCh. 6 - Prob. 6RPCh. 6 - Prob. 7RPCh. 6 - Prob. 8RPCh. 6 - Prob. 9RPCh. 6 - Prob. 10RPCh. 6 - Prob. 11RPCh. 6 - Prob. 13RPCh. 6 - Prob. 14RPCh. 6 - Prob. 15RPCh. 6 - Prob. 17RPCh. 6 - Prob. 18RPCh. 6 - Prob. 19RPCh. 6 - Prob. 20RPCh. 6 - Prob. 21RPCh. 6 - Prob. 22RPCh. 6 - Prob. 25RPCh. 6 - Prob. 29RPCh. 6 - Prob. 33RPCh. 6 - Prob. 34RPCh. 6 - Prob. 35RPCh. 6 - Prob. 36RPCh. 6 - Prob. 37RP
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.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning