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 6.3, Problem 4P
Explanation of Solution
New optimal solution
- Let
- Let
- For a maximization problem, the new optimal value = (old optimal value) + (Constraint i’s shadow price).
- For a minimization problem, the new optimal value = (old optimal value) – (Constraint i’s shadow price).
- If the table is sold for $50 and one board feet of lumber, three finishing hours and 1.5 carpentry hours are used, and then the current basis will no longer be optimal.
- The new optimal table is determined by computing the columns in the current optimal table
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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?
Solve the following exercise using jupyter notebook for Python, to find the objective function, variables, constraint matrix and print the graph with the optimal solution.
A farm specializes in the production of a special cattle feed, which is a mixture of corn and soybeans. The nutritional composition of these ingredients and their costs are as follows:
- Corn contains 0.09 g of protein and 0.02 g of fiber per gram, with a cost of.$0.30 per gram.- Soybeans contain 0.60 g of protein and 0.06 g of fiber per gram, at a cost of $0.90 per gram.0.90 per gram.
The dietary needs of the specialty food require a minimum of 30% protein and a maximum of 5% fiber. The farm wishes to determine the optimum ratios of corn and soybeans to produce a feed with minimal costs while maintaining nutritional constraints and ensuring that a minimum of 800 grams of feed is used daily.
Restrictions
1. The total amount of feed should be at least 800 grams per day.2. The feed should contain at least 30% protein…
Solve the following problem and find the optimal solution.
Chapter 6 Solutions
Operations Research : Applications and Algorithms
Ch. 6.1 - Prob. 1PCh. 6.1 - Prob. 2PCh. 6.1 - Prob. 3PCh. 6.1 - Prob. 4PCh. 6.1 - Prob. 5PCh. 6.2 - Prob. 1PCh. 6.2 - Prob. 2PCh. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Prob. 3P
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
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
- In regards of the problem:max cTx subject to Ax = b, with an optimal solution of value v. Suppose the problem min cT x, subject to Ax = b have great with the same value, v. It can be concluded that there is a singlegood point for both? How is the feasible region geometrically?arrow_forwardTwo investments with varying cash flows (in thousands of dollars) are available, as shown in the table below. At time 0, $10,000 is available for investment, and at time 1, $7,000 is available. Assuming that r 0.10, set up an LP whose solution maximizes the NPV obtained from these investments. Graphically find the optimal solution to the LP.arrow_forwardQUESTION 9 What is one advantage of AABB over Bounding Spheres? Computing the optimal AABB for a set of points is easy to program and can be run in linear time. Computing the optimal bounding sphere is a much more difficult problem. The volume of AABB can be an integer, while the volume of a Bounding Sphere is always irrational. An AABB can surround a Bounding Sphere, while a Bounding Sphere cannot surround an AABB. To draw a Bounding Ball you need calculus knowledge.arrow_forward
- 1. Consider an instance of the Knapsack Problem without repetitions with 4 items, having weights and values as follows. The weights (in pounds) are w1=2, w2 =7, w3 =10, w4 =12. The dollar values of these items are respectively v1 = 12, v2 = 28, v3 = 30, v4 = 5. The capacity of the knapsack is 12. (a) Find the optimal solution for Fractional Knapsack. (b) Find the optimal solution for 0-1 Knapsack.arrow_forwardExcercise 3.1 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. Please detailed :( Thank you so mucharrow_forwardUsing Python/PuLP solve At the beginning of month 1, Finco has $400 in cash. At the beginning of months 1, 2, 3, and 4, Finco receives certain revenues, after which it pays bills (see Table 2 below). Any money left over may be invested for one month at the interest rate of 0.1% per month; for two months at 0.5% per month; for three months at 1% per month; or for four months at 2% per month. Use linear programming to determine an investment strategy that maximizes cash on hand at the beginning of month 5. Formulate an LP to maximize Finco’s profit. Table 2 Month Revenues ($) Bills ($) 1 400 600 2 800 500 3 300 500 4 300 250arrow_forward
- Consider the following linear programming model: Max 2X1 + 3X2 Subject to: X1 ≤ 2 X2 ≤ 3 X1 ≤ 1 X1, X2 ≥ 0 This linear programming model has: a. alternate optimal solutions b. infeasible solution c. redundant constraint d. unbounded solutionarrow_forwardThe Pee Tool Shop has four heavy presses it uses to stamp out prefabricated metal covers and housings for electronic consumer products. All four presses operate differently and are of different sizes. Currently the firm has a contract to produce three products. The contract calls for 400 units of product 1; 570 units of product 2; and 320 units of product 3. The time (in minutes) required for each product to be produced on each machine is as follows: SOLVE THE MODEL BY USING MS EXCELarrow_forwardThree products are manufactured on one machine. The preparation time of each product is 2,3 and 4 minutes respectively, and the process time of 3, 2 and 1 minutes. The benefit provided byeach product is respectively 12, 10 and 15 UM. There are 100 machine minutes and 200for its preparation. Determine the optimal number of units to manufacture of eacharticle.do it in Jupyter Notebook (.ipynb) with the code, the tables of the simplex method and the graphs of theoptimal solution.Identify the decision variables that will represent the quantity of each productto manufacture.Formulate the linear programming problem to maximize total profitsubject to the given restrictions.arrow_forward
arrow_back_ios
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