Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
Expert Solution & Answer
Book Icon
Chapter 3.8, Problem 4P

Explanation of Solution

 Formulation of a Linear Programming (LP) to maximize total profit earned from Erica’s investment:

 Let “x1” be the number of dollars invested in stocks.

 The “x2” be the number of dollars invested in loans.

 As every dollar invested in stocks gives 10 cents profits, so the total profit on stocks would be $0.1x1. Likewise, the total profit on loan would be $0.15x2.

 Since the objective is to maximize total profit earned from Erica’s investment, the objective function is defined as follows:

 Max Z=0.10x1+0.15x2

 Constraint 1:

 At least, 30% of total invested money must be invested in stocks. The “x1+ x2” is the total money invested in the investment. Since the number of dollars invested in stocks must be at least 30% of the total investment, the constraint is defined as follows:

 x10.3(x1+x2)0.7x10.3x20

 Constraint 2:

 At least, $400 of all money must be invested in loans, so the constraint is defined as:

 x2400

 Constraint 3:

 At most, $1000 is invested in stocks and loans, so the constraint is defined as:

 x1+x21000

 Therefore, the formulation to the given linear program is:

 Max Z=0

Blurred answer
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 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?
The ABC Company produces three electrical products—blenders, choppers, and toasters. The manufacturer has a maximum daily production budget of RM2000 and a maximum of 660 hours of labor. Maximum daily customer demand is for 200 blenders, 300 choppers, and 150 toasters. The unit profit for blender is RM8, choppers, RM10, and toaster, RM7. The company desires to know the optimal product mix that will maximize profit. These products have the following resource requirements as shown in Table 1. After solving the problem using linear programming, Table 4 shows the LP sensitivity report. Based on the report, answer the following questions and justify all your answers. Formulate the LP model for the above case study. Optimize the Company ABC production using simplex method. Verify your answer in (b) using SOLVER. Provide SOLVER Answer Report, Sensitivity Report, and Excel Sheet of your modelling.  Suppose that the company would like to increase the profit of the toasters to RM9 per unit…

Chapter 3 Solutions

Operations Research : Applications and Algorithms

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 Finco’s 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 - Graphically find all solutions to the following...Ch. 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
Background pattern image
Similar questions
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole