Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3.11, Problem 1P
Explanation of Solution
Reasons:
- At time “3”, cash on hand of a company Finco is the sum of the money that inflow from all the investments and from market funds at time “3”.
- Investment “A” is able to be obtained only for “2” years.
- Investment “C” is also to be obtained only for “2” years.
- Investments “B”, “D”, and “E” are able to be obtained for “3” years.
- Hence, from these above funds, the cash on hand after “3” years is “
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Portfolio manager Max Gaines needs to develop an investment portfolio for his clients who are willing to accept a moderate amount of risk. His task is to determine the proportion of the portfolio to invest in each of the five mutual funds listed below so that the portfolio maximizes the expected return but provides an annual return of no less than 3%. for each of the following scenarios.
Annual Returns (Planning Scenarios):
mutual fund
yr 1
yr 2
yr 3
yr 4
international stock
22.37
26.73
6.46
-3.19
low-cap blend
14.88
18.61
10.52
5.25
mid-cap blend
19.45
18.04
5.91
-1.94
small-cap blend
13.79
11.33
-2.07
6.85
intermediate bond
7.29
8.05
9.18
3.92
Formulate the appropriate linear program for this situation. (state the objective function, the decision variables, and the constraints)
A variable that assumes an optimal value between its lower and upper bounds has a reduced cost value of zero. Why must this be true? (Hint: What if such a variable’s reduced cost value is not zero? What does this imply about the value of the objective function?)
A blood bank wants to determine the least expensive way to transport available blood donations from Pittsburgh and Staunton to hospitals in Charleston, Roanoke, Richmond, Norfolk, and Suffolk. The supply and demand for donated blood is shown in the figure along with the unit cost of shipping along each possible arc.
Provide the complete linear programing formulation. Clearly specify decision variables, objective function and constraints.
Build a model in Excel and paste a screenshot here. Use “FORMULATEXT” in your model to show calculations.
According to Excel Solver, what is the optimal transportation plan for blood bank? What is the minimum total shipping cost?
Chapter 3 Solutions
Introduction to mathematical programming
Ch. 3.1 - Prob. 1PCh. 3.1 - Prob. 2PCh. 3.1 - Prob. 3PCh. 3.1 - Prob. 4PCh. 3.1 - Prob. 5PCh. 3.2 - Prob. 1PCh. 3.2 - Prob. 2PCh. 3.2 - Prob. 3PCh. 3.2 - Prob. 4PCh. 3.2 - Prob. 5P
Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Fincos objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Prob. 31RPCh. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
Knowledge Booster
Similar questions
- L. Brown, a direct marketer of women’s clothing, must determine how many telephone operators to schedule during each part of the day. W. L. Brown estimates that the number of phone calls received each hour of a typical eight-hour shift can be described by a discrete probability distribution in the excel template file. Each operator can handle 15 calls per hour and costs the company $20 per hour. Each phone call that is not handled is assumed to cost the company $6 in lost profit. Considering the options of employing 6, 8, 10, 12, 14, or 16 operators, use simulation to determine the number of operators that minimizes the expected hourly cost (labor costs plus lost profits).arrow_forwardWhich of the following statements are true given A* (admissibility and consistency of heuristics ] ? The heuristic function h[n] is called admissible if h[n] is never larger than h*[n], namely h[n] is always less or equal to true cheapest cost from n to the goal. If the heuristic function, h always underestimates the true cost [h[n] is smaller than h*[n]), then A* is guaranteed to find an optimal solution. When h is inconsistent, it can not be admissible. If h is consistent and h[goal)=0 then h is admissible A* is complete and optimalarrow_forwardYou have the opportunity to buy a project that yields at the end of years 1–5 the following (random) cash flows: End of year 1 cash flow is normal with mean 1,000 and standard deviation 200. For t 1, end of year t cash flow is normal with Mean actual end of year (t 1) cash flow and Standard deviation .2*(mean of year t cash flow). a Assuming cash flows are discounted at 10%, deter- mine the expected NPV (in time 0 dollars) of the cash flows of this project. b Suppose we are given the following option: At the end of year 1, 2, 3, or 4, we may give up our right to fu- ture cash flows. In return for doing this, we receive the abandonment value given in Table 5. Assume that we make the abandonment decision as follows: We abandon if and only if the expected NPV of the cash flows from the remaining years is smaller than the abandonment value. For example, suppose end of year 1 cash flow is $900. At this point in time, our best guess is that cash flows from years 2–5 will also be $900. Thus,…arrow_forward
- The 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_forwardDemand of product A varies with the price as guided by the following equation. Demand = -1.5 * price + 25 Moreover, sale of product A leads to sale of another product B of the same company. Additional data is as given below. Unit cost of A (Rs.) 3 Number of units of B with one A 20 Profit from sale of one unit of B (Rs.) 0.85 Develop the optimization model for pricing of A to maximize total profit earned and find the optimal price.arrow_forwardGiven a loss function, any loss function, what is a concern when using any optimization algorithm for finding the minimum of that loss function? Group of answer choices Unknowingly finding a local minimum instead of a global minimum Unknowingly finding a global maximum instead of a local maximum Unknowingly finding a global minimum instead of a local minimum Unknowingly finding a local maximum instead of a global maximumarrow_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