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 5.1, Problem 4P
a.
Explanation of Solution
Range of values
- The slope of the line is between the other variables
b.
Explanation of Solution
Range of values
- The slope of the line is between the other variables
c.
Explanation of Solution
Range of values
- The slope remains the same when the line drops or lifts...
d.
Explanation of Solution
Range of values
- If High Income Men requirement is 8 then the feasibility is lost.
- If HIM requirement is decreased t...
e.
Explanation of Solution
Shadow price
- For High Income Men, the value of RHS is 24 + ∆.
- Then the RHS of the c...
f.
Explanation of Solution
Optimum value
- For High Income Women, the value of RHS is 24 + ∆.
- Then the RHS of the constraint will represent a worse value of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook 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.
Consider a maximization problem that is being solved by Simulated Annealing. Let
the objective function value of the current state, s, be 1000. Let this state have 5
successors/neighbors: s1(950), s2(975), s3(1000), s4(1000), and s5(1050). The
numbers in parentheses represent the corresponding objective function values.
The current temperature is 100. The probability that the next state is:
1. s1 = [Select]
2. s2 = [Select]
3. s3 [Select]
=
4. s4= [Select]
[Select]
5. s5
0.778
0.121
0.156
0.2
0.606
In 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.
Chapter 5 Solutions
Operations Research : Applications and Algorithms
Ch. 5.1 - Prob. 1PCh. 5.1 - Prob. 2PCh. 5.1 - Prob. 3PCh. 5.1 - Prob. 4PCh. 5.1 - Prob. 5PCh. 5.2 - Prob. 1PCh. 5.2 - Prob. 2PCh. 5.2 - Prob. 3PCh. 5.2 - Prob. 4PCh. 5.2 - Prob. 5P
Ch. 5.2 - Prob. 6PCh. 5.2 - Prob. 7PCh. 5.2 - Prob. 8PCh. 5.3 - Prob. 1PCh. 5.3 - Prob. 3PCh. 5.3 - Prob. 4PCh. 5.3 - Prob. 5PCh. 5.3 - Prob. 6PCh. 5.3 - Prob. 7PCh. 5.3 - Prob. 9PCh. 5.3 - Prob. 10PCh. 5.3 - Prob. 11PCh. 5 - Prob. 1RPCh. 5 - Prob. 2RPCh. 5 - Prob. 3RPCh. 5 - Prob. 4RPCh. 5 - Prob. 6RPCh. 5 - Prob. 7RPCh. 5 - Prob. 8RPCh. 5 - Prob. 9RPCh. 5 - Prob. 10RPCh. 5 - Prob. 11RPCh. 5 - Prob. 12RPCh. 5 - Prob. 13RPCh. 5 - Prob. 14RPCh. 5 - Prob. 15RPCh. 5 - Prob. 16RP
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_forwardVariable 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_forwardA 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?arrow_forward
- Given 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_forwardSuppose 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?arrow_forwardYou are given some tasks of size xK, yK and zK respectively and there are at most 9 tasks each. Determine the best that you could achieve if you are to fill up a hole of size SK, for the following values of x, y, z and S, by maximizing the space used (up to S), i.e. minimizing the used space, if any. Show how many tasks of size x, how many tasks of size y and how many tasks of size z are used in each of the three cases. (g) Now if we relax the requirement so that there are no upper limits on the number of tasks for each type, determine the maximal space usage and the task mix. (h) If we tighten the requirement so that there are still at most 9 tasks of each size, but we also require that each type of tasks must be used at least once, determine maximal space usage and the task mix. Case 1 2 3 X 22 26 28 y 33 43 65 50 77 74 S 488 556 777 You could complete the following table. Fill in the number of tasks inside the brackets and the corresponding maximal usage. (At most 9 tasks each (g)…arrow_forward
- Ridgley 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_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 tableau is not optimal for either maximization or a minimization problem. Thus, when a nonbasic variable enters the solution it can either increase or decrease Z or leave it unchanged, depending on the parameters of the entering nonbasic variable. Basic Z 0 -5 0 4 -1 -10 0 0 598 0 3 0 -2 -3 -1 5 1 12 0 1 1 3 1 0 3 0 6 1 -1 0 0 6 -4 0 0 0 Categorize the variables as basic and nonbasic and provide the current values of all the variables. AP [8] Assuming that the problem is of the maximization type, identify the nonbasic variables that have the potential to improve the value of If each such variable enters the basic solution, determine the associated leaving…arrow_forward
- S 11 Parameter Susceptible Population IlIl Population Zombie Population Removed Population Birth rate Naturally ill rate Intentionally ill rate Removed from illness rate Susceptible to zombie rate Removed Zombie rate I Symbol (Model) S I Z R a b Z C d R Value 1000 1 1 0 1 0.16 0.34 0.27 0.6 0.08 2. 1. Show the equilibrium and local stability of the system. Show the graph of the dynamics of the population when there is a lower susceptibility to zombie rate and with a higher ill rate. (Using Python) 3. Show the graph of the dynamics of the population when there is a higher susceptibility to zombie rate and with a lower ill rate. (Using Python)arrow_forward6. Consider a modification to the rod-cutting problem in which, in addition to a value pi for each rod, there is handling cost ci that is one and a half times the length of the rod cut plus a flat fee of 3 (i.e., the handling cost to cut a rod of length 5 is 7.5+3 =10). The revenue generated is the sum of the value of the pieces cut minus the sum of handling costs of the cuts. Provide a dynamic programming approach to solve this problem given an initial rod of length n with potential cut lengths of 1, 2, 5, and 7 [Adapted from ITA, pg. 370, 15.1-3] length of cut (i) 1 2 5 7 value (pi) 5 7 30 45 handling cost (ci) 4.5 6 10.5 13.5arrow_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_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