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.1, Problem 4P
a.
Explanation of Solution
Range of values
- Let
- Let HIW stand for high-income women and HIM stands for high-income men.
- Hence high-income men and high-income women are the two constraints in the problem.
- An optimal solution is found when a line known as isocost line intersects the feasible region
b.
Explanation of Solution
Range of values
- Let
- Let HIW stand for high-income women and HIM stands for high-income men.
- Hence high-income men and high-income women are the two constraints in the problem.
- An optimal solution is found when a line known as isocost line intersects the feasible region
c.
Explanation of Solution
Range of values
- Let
- Let HIW stand for high-income women and HIM stands for high-income men.
- Hence high-income men and high-income women are the two constraints in the problem.
- An optimal solution is found when a line known as isocost line intersects the feasible region.
- Hence isocost line is any line on which all points have the same optimal value or the same cost
d.
Explanation of Solution
Range of values
- Let
- Let HIW stand for high-income women and HIM stands for high-income men.
- Hence high-income men and high-income women are the two constraints in the problem.
- An optimal solution is found when a line known as isocost line intersects the feasible region.
- Hence isocost line is any line on which all points have the same optimal value or the same cost
e.
Explanation of Solution
Shadow price
- In linear programming, the shadow price of a constraint is the difference between the optimised value of the objective function and the value of the objective function at the optional basis.
- Here there are two constraints, high on income women and high on income men...
f.
Explanation of Solution
New optimal solution
- Let
- Let HIW stand for high-income women and HIM stands for high-income men.
- Hence high-income men and high-income women are the two constraints in the problem
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
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.
A pig weighting 200 pounds gains 5 pounds per day and costs 45 cents aday to keep. The market price for pigs is 65 cents per pound, but is falling 1 cent perday.a/ When should the pig be sold? What is the optimal profit?b/ What are the sensitivities of the optimal time and optimal profit with respect to the45-cent upcost?c/ What are the sensitivities of the optimal time and optimal profit with respect to the1-cent market depreciation?
Suppose the risk index for the stock fund (the value of ) increases from its current value of 8 to 12. How does the optimal solution change, if at all?
Suppose the risk index for the money market fund (the value of ) increases from its current value of 3 to 3.5. How does the optimal solution change, if at all?
Suppose increases to 12 and increases to 3.5. How does the optimal solution change, if at all?
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
- Markov Decision Process (MDP) – Ch5 10 B F 6. Consider the MDP above, with states represented as nodes and transitions as edges between nodes. The rewards for the transitions are indicated by the numbers on the edges. For example, going from state B to state A gives a reward of 10, but going from state A to itself gives a reward of 0. Some transitions are not allowed, such as from state A to state B. Transitions are deterministic (if can choose to go from one to the other and will there is an edge between two states, the reach the other state with probability 1). A. Suppose that the max horizon length is 15, write down the optimal action at each step if the discount factor is y = 1.arrow_forwardb) Consider the following linear programming problem: Min z = x1 + x2 s.t. 3x1 – 2x2 < 5 X1 + x2 < 3 3x1 + 3x2 2 9 X1, X2 2 0 Using the graphical approach, determine the possible optimal solution(s) and comment on the special case involved, if any.arrow_forwardThe shaded region in the given figure above illustrates an unbounded feasible region. Which of the following is true? I. The maximum value for the objective function does not exist in an unbounded feasible region. II. If the objective function is Min Z=x+y, then it's maximum is 25 at (25,0). III. If the objective function is Max Z=-x+2y, then it's minimum is O at (25,0). IV. Unbounded feasible regions have either maximum or minimum value. 024 10 (25 0) -20 -10 10 O A. I O B. II O C.I and II O D. II and IVarrow_forward
- Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease Туре А 4 -3.5 1E+30 Туре B y Туре С 3. 6. 2 Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease Hours 1. 15 1 15 12 8. Plastic 20 30 1E+30 30 Cotton 70 70 40 55 Calculate the optimal value of the objective function if the coefficient of "x" changes to 4 and the coefficient of "y" changes to 3.5. Hint: Since it is proposing a simultaneous change (more than one change at a time), we have to check the 100% rule. **Enter the number only** **Do not use any words or symbols** Answer: 5 M 5arrow_forwardIn this problem we have n jobs j1, j2, ..., jn, each has an associated deadline d1, d2, ..., dn and profit p1, p2, ..., pn. Profit will only be awarded or earned if the job is completed before the deadline. We assume that each job takes 1 unit of time to complete. The objective is to earn maximum profit when only one job can be scheduled or processed at any given time.Provide the pseudocode of an algorithm to find the sequence of jobs to do with the maximum total profit. Also describe the main idea of your algorithm using plain language.[Hint: You can select the jobs in a greedy way. You can use the following example to help your analysis.] Job J1 J2 J3 J4 J5 Deadline 2 1 3 2 1 Profit 60 100 20 40 20 The best job sequence would be J2 →J1 →J3.arrow_forwardGiven the objective function 2x1+5x2 that needs to be maximized and the graphical solution shown below, what is the optimal value of the objective function? 420 20 [ [8] Answer: 45arrow_forward
- Two 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_forwardConsider that there are four items that can fit inside a 13-pound-capacity backpack. The respective weights of the items are 5.7, 4, and 3 pounds. Their respective utilities are 8, 11, 6, and 4 utils. Determine the optimal solution that maximizes the overall usefulness of the backpack.arrow_forward6. Firms 1 and 2 compete Bertrand-style. They each have zero marginal costs and zero fixed costs, and simply wish to maximize their own revenue. For a constant K > 0, demand is q = K – p for the firm with the lower price and zero for the firm with the higher price, or q = 0.5(K – p) if both firms set the same price. When it matters, firms have a time discount factor 8. a. Find the unique NE prices and profits of the static game. b. Suppose there was only one firm who set monopoly prices, called pm. What would Pm be? Back to two competing firms. c. Suppose this game is repeated 10 times; describe the unique SPNE outcome. d. Suppose the game is repeated indefinitely. Describe SPNE strategies that would result in both players playing pm, given high enough 6. e. What is the lowest & can be for your strategy described in part (d) to work?arrow_forward
- Why is it that each LP with an optimum solution also has an optimal fundamental viable solution to the problem?arrow_forwardRidgley Custom Metal Products (RCMP) must purchase a new tube bender. RCMP's MARR is 12 percent. RCMP can forecast demand for its products for only 4 years in advance. The salvage value after 4 years is $50,000 for model T, $85,000 for model A and $75,000 for model X. Using the study period method, which of the three alternatives is best? Salvage Value $50.000 Yearly Net Savings $55.000 $50.000 $65.000 Model First Cost Economic Life $100,000 $140,000 $190,000 4 years 4 years A $85,000 $75,000 4 years Click the icon to view the table of compound interest factors for discrete compounding periods when i= 12%. The present worth of Model T is $. The present worth of Model A is $ The present worth of Model X is $. Model V is the better choice to buy. (Round to the nearest cent as needed.)arrow_forwardThe following LP formulation represents a transportation problem where raw material (in tons] from Supplier i, i={1,2,3} to Plant j, j={1,2,3). The problem is solved and the optimal objective function value is 5200. Using the sensitivity report shown below, what would be the optimal total cost if the cost of transporting 1 ton from Supplier 1 to Plant 1 becomes 2 and the cost of transporting 1 ton from Supplier 3 to Plant 3 becomes 2.5? Min Total cost = 1x11 + 3x12 + 5x13 +3.5x21 +4x22+4.8x23 +3.5x31+3.6x32+3.2x33 Subject to x31+x32+x33 = 0, for i= {1,2,3} &j= {1, 2, 3} Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease Name 500 1 2.5 1E+30 700 3 0.6 1E+30 200 1E+30 0.2 0 2.5 0 1E+30 1E+30 0.2 1E+30 1 1E+30 200 2.5 0 1E+30 0.6 1.8 1E+30 Variables X11 X12 X13 X21 X22 X23 X31 X32 X33 10 200 000000000 5 3.5 4 4.8 3.5 3.6 3.2arrow_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