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 4P

Explanation of Solution

Stating the optimal solution:

  • The LINDO output is considered for the diet problem:
  • min z= 50BR+20IC+30CLA+80PC
  • Subject to constraint:
    • 400BR+200IC+150CLA+500PC500
    • 3BR+2IC6
    • 2BR+2IC+4CLA+4PC10
    • 2BR+4IC+CLA+5PC8
  • End
  • LP optimum is found at step 5
  • Objective function value: 90.000000
VariableValueReduced cost
BR0.00000027.500000
IC3.0000000.000000
CLA1.0000000.000000
PC0.00000050.000000
RowSlack or SurplusDual prices
2250.0000000.000000
30.000000-2.500000
40.000000-7.500000
55.0000000.000000
  • Number of iterations= 5
  • The ranges in which the basis is unchanged:
VariableCurrent coefficientOBJ coefficient ranges allowable increaseAllowable decrease
BR50

Blurred answer
Students have asked these similar questions
ACE Hardware wants to develop a daily schedule for its employees in one of its stores in Omaha. Currently,this store has five employees and the store is opened from 12pm to 9pm. The store must always have at leasttwo people on hand. Each employee must work at least four hours and no more than eight hours per day.Employee #1 goes to school and cannot start before 4pm while all other employees can work at any time.Furthermore, employee #1 earns $10 per hour while all other employees earn $12 per hour. Because all fiveemployees live so close to the store, you must assume that they do not need to work consecutive hours.a) Formulate an optimization model for this problem.b) Solve the optimization model using either the Microsoft Excel Solver or the IBM ILOG CPLEXOptimization Studio.
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?
3. National Disc Corp. produces the discs used in producing Xbox and PlayStation discs. Their local plant runs 24 hours a day, 7 days a week. In a given day, there are requirements for the total number of employees that must be at the plant. These are given below. Employees Needed Hours 12am - 4am 4am - 8am 8am-12pm 12pm - 4pm 4pm - 8pm 8pm-12am 8 10 16 21 18 12 Employees can either work 8-hour or 12-hour shifts, starting at the times stated above (12- hour shifts can start only at 12 am/pm or 8 am/pm). Those working 8-hour shifts cost the company $40 per hour in benefits, and those working 12-hour shifts cost the company $60 per hour. Develop a linear program that can be used to determine how National should staff the local plant so as to minimize labor costs (you do not need to solve the model). Be sure to clearly identify your variables.

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