Concept explainers
Explanation of Solution
Calculation to obtained the maximizes the NPV from the given investment:
The Net Present Value (NPV) of an investment is the amount by which the investment will increase the firm’s value.
Assuming the annual rate interest, “r = 0.10”, the user can compute the NPV for investment 1 as,
Now, the user computes the NPV for investment 1 as,
Therefore, the NPV of investment 1 is larger than investment 2.
Let, “x1” be the fraction of investment 1 that is undertaken and “x2” be the fraction of investment 2 that is undertaken.
The objective function is to maximize the NPV of the investment.
Therefore, maximize
Constraint 1:
At time 0, $10000 is available for investment
Trending nowThis is a popular solution!
Chapter 3 Solutions
Introduction to mathematical programming
- 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_forwardA person is cutting a long board of wood into different length of pieces. Each cutting has fixed width 2 cm lengths. Given that each cutting with different length has a different price, Now, we are required to help this person to find the optimal cuts in order to increase his income. Consider following example showing different cut's lengths and their equivalent prices. Input: board length = 4 Length [] = [1, 2, 3, 4, 5, 6, 7, 8] Price [ 1= [2, 6, 8, 10, 14, 17, 19, 20] Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12 [Explanation: the possible cuts and profit of each is as follows: Cut Profit 4 1,3 2,2 3,1 1,1,2 1,2,1 2,1,1 1,1,1,1 10 (2+8) = 10 (6+6) = 12 (8+2) = 10 (2+2+6) = 10 (2+6+2) = 10 (6+2+2) = 10 (2+2+2+2) = 8 As noted the best cut is two pieces of length 2 each to gain revenue of 6+ 6 = 12 To answer question 1, you need to do the following: 1. Write an algorithm to find the optimal cuts in order to increase the person income's 2. Implement the…arrow_forwardA person is cutting a long board of wood into different length of pieces . Each cutting has fixed width 2 cm lengths. Given that each cutting with different length has a different price, Now, we are required to help this person to find the optimal cuts in order to increase his income. Consider following example showing different cut’s lengths and their equivalent prices. Input: board length = 4 Length [ ] = [1, 2, 3, 4, 5, 6, 7, 8] Price [ ] = [2, 6, 8, 10, 14, 17, 19, 20] Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12 [Explanation: the possible cuts and profit of each is as follows: As noted the best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12arrow_forward
- 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?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_forwardIf it is possible to create an optimal solution for a problem by constructing optimal solutions for its subproblems, then the problem possesses the corresponding property. a) Subproblems which overlap b) Optimal substructure c) Memorization d) Greedyarrow_forward
- Consider 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_forwardPlease explain! Dynamic Programming can be used to solve numerous real-life optimization problems. Consider these six problems.Five of these six problems have elegant and efficient solutions using Dynamic Programming, but one of these problems does not. Which of these six problems cannot be solved using Dynamic Programming? Choice 1 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to maximize your profit Choice 2 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to minimize your profit Choice 3 of 6: Given a graph, determine the shortest path from the start vertex to the end vertex without repeating any edges Choice 4 of 6: Given a graph, determine the longest path from the start vertex to the end vertex without repeating any edges Choice 5 of 6: Given a sequence of integers, determine the longest increasing subsequence of that sequence Choice 6 of 6: Given a sequence of integers,…arrow_forwardConsider the following 0-1 knapsack problem, the items, their weights and their profits appear in table below. If the knapsack has capacity 11 select the items that appear in the solution? i.e. select answers 1, 2,and 3 if those are the items in the optimal knapsack. Item 2 3 5 6 Weight 1 2 3 4 5 6 Profit 10 13 15 U item 1 U item 2 U item 3 U item 4 U item 5 U item 6 O O O O O Oarrow_forward
- CSPS Consider the following (normal-form) game. Formulate the problem of finding a pure Nash equilibrium of this game as a constraint satisfaction problem R U 2,2 | 0,1 D 0,0 1,1 Linear Programming Consider the same game and suppose the row player adopts a strategy of (0.6,0.4). Give a linear program whose optimal solution gives a best reply for the column player. (You do not need to solve the linear program.)arrow_forwardA circus is planning a tower act in which individuals stand on top of one another's shoulders. Each individual must be both shorter and lighter than the person below him or her for practical and aesthetic reasons. Write a way to determine the maximum feasible number of people in such a tower given the heights and weights of each individual in the circus.arrow_forwardFind an optimal solution to the fractional knapsack problem for an Instance with number of items i.e n= 3, Capacity of the sack M=20, profit associated with the items (p1,p2,p3)= (25,24,15) and weight associated with each item (w1,w2,w3)= (18,15,10).arrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole