Concept explainers
a)
To determine: The impact of adding an extra constraint to the feasible area of a solved linear programming problem.
Introduction:
Linear programming:
It is a linear optimization technique followed to develop the best outcome for the problem in hand. The outcome might be of maximum profit or less cost which is represented by a linear relationship. The outcome will take into consideration the constraints present in achieving the solution.
Constraints:
The constraints are the limitation for a situation within which the process must operate. The constraints are the limits within which the available resources can be utilized that will help to maximize or minimize an amount.
Feasible region:
A feasible region is a solution space which contains all the possible points of an optimization problem. The region will be formed after satisfying the constraints in the problem which includes inequalities, integer constraints and inequalities. It is the area that is bounded by the constraints of the problem.
b)
To determine: The impact of adding an extra constraint to the optimal value of the objective function of a solved linear programming problem.
Introduction:
Linear programming:
It is a linear optimization technique followed to develop the best outcome for the problem in hand. The outcome might be of maximum profit or less cost which is represented by a linear relationship. The outcome will take into consideration the constraints present in achieving the solution.
Constraints:
The constraints are the limitation for a situation within which the process must operate. The constraints are the limits within which the available resources can be utilized that will help to maximize or minimize a quantity.
Feasible region:
A feasible region is a solution space which contains all the possible points of an optimization problem. The region will be formed after satisfying the constraints in the problem which includes inequalities, integer constraints and inequalities. It is the area that is bounded by the constraints of the problem.
Want to see the full answer?
Check out a sample textbook solutionChapter B Solutions
Operations Management: Sustainability and Supply Chain Management (12th Edition)
- Problem 2: Applications of Linear Programming: Visa Inc. Stock sells for $92 a share and has 3-year average annual return of $20 a share. The beta value is 1.06. JP Morgan Chase and Co. sells for $87 a share and has a 3-year average annual return of $17 a share. The beta value is 1.21. Derek wants to spend no more than $15,000 investing in these two stocks, but he wants to earn at least $2500 in annual revenue. Derek also wants to minimize the risk. Determine the number of shares of each stock that Derek should buy.arrow_forwardProblem 7-25 (Algorithmic) George Johnson recently inherited a large sum of money; he wants to use a portion of this money to set up a trust fund for his two children. The trust fund has two investment options: (1) a bond fund and (2) a stock fund. The projected returns over the life of the investments are 9% for the bond fund and 20% for the stock fund. Whatever portion of the inheritance George finally decides to commit to the trust fund, he wants to invest at least 60% of that amount in the bond fund. In addition, he wants to select a mix that will enable him to obtain a total return of at least 8.5%. a. Formulate a linear programming model that can be used to determine the percentage that should be allocated to each of the possible investment alternatives. If required, round your answers to three decimal places. Let B = percentage of funds invested in the bond fund S percentage of funds invested in the stock fund s.t. Optimal solution: B = Value of optimal solution is S = B + % B B…arrow_forwardB & Carrow_forward
- Problem 7-25 (Algorithmic) George Johnson recently inherited a large sum of money; he wants to use a portion of this money to set up a trust fund for his two children. The trust fund has two investment options: (1) a bond fund and (2) a stock fund. The projected returns over the life of the investments are 5% for the bond fund and 30% for the stock fund. Whatever portion of the inheritance George finally decides to commit to the trust fund, he wants to invest at least 80% of that amount in the bond fund. In addition, he wants to select a mix that will enable him to obtain a total return of at least 6.5%. a. Formulate a linear programming model that can be used to determine the percentage that should be allocated to each of the possible investment alternatives. If required, round your answers to three decimal places. Let B = S Max s.t. percentage of funds invested in the bond fund percentage of funds invested in the stock fund Optimal solution: B Value of optimal solution is X X,S= B X…arrow_forwardThe High-Price Oil Company owns a pipeline network that is used to convey oil from its source to several storage locations. A portion of the network is as follows: Due to the varying pipe sizes, the flow capacities vary. By selectively opening and closing sections of the pipeline network, the firm can supply any of the storage locations. a. If the firm wants to fully utilize the system capacity to supply storage location 7, how long will it take to satisfy a location 7 demand of 100,000 gallons? What is the maximal flow for this pipeline system? b. If a break occurs on line 2–3 and that line is closed down, what is the maximal flow for the system? How long will it take to transmit 100,000 gallons to location 7?arrow_forwardSUPPOSE THAT THE OPPORTUNITY COST OF A MINIMIZATION ASSIGNMENT PROBLEM BECOMES II IV A. 4 3 10 B 4 2 10 6 2 10 4 WHICH OF THE FOLLOWING GIVES AN OPTIMAL ASSIGNMENT? A is assigned to IV Bis assigned to II Cis assigned to I Dis assigned to II No optimal assignment is possible yet. O A is assigned to lII Bis assigned to IV Cis assigned tol Dis assigned to II O A is assigned to l Bis assigned to IV Cis assigned to II Dis assigned to IIarrow_forward
- For a "Dual minimization problem" with optimal point equal to (x1 = 5, x2 = 1) and best Z = 56, its respective "Primal maximization problem " would have Please choose the option that would best fit the empty space above. Its respective best Z also equal to 56. Shadow prices equal to 1 (x1) and 5 (x2), respectively. Shadow prices exactly the same as the shadow prices obtained in the Primal problem. Exactly the same optimal point. None of the abovearrow_forwardDiscuss the five (5) steps of the Theory of Constraints and apply each to asimulation/assumption of a constraint impacting Jaguar.arrow_forwardPlease no written by hand solutionarrow_forward
- Find the x- intercept and y- intercept of each constraints and graph.arrow_forwardMax 50X + 40Y Subject to: X + Y >= 5 X-3Y = 135 X, Y >= 0 Answer the following Questions: (Constraint #1) (Constraint #2) (Constraint #3) (Constraint #4) (Constraint #5) a) Does an optimal solution exist? If so, what is the optimal solution? If not, why does not an optimal solution exist? Show your calculations and answers clearly. b) Does constraint #5 have slack or surplus? If so, which one and how much? c) Up to how much can the coefficient of Y in the objective function increase without changing the optimal solution? Show your calculations and answers clearly. d) If one increases the righthand side value of constraint #2 by 2, by how much does the value of the objective function change, compared with that at the original optimal solution? Show your calculations and answers clearly. e) Up to how much can the righthand side value of constraint #1 be increased without changing the dual value (i.e., the shadow price) of constraint #1? Answers clearly and describe reasons. f) If one…arrow_forwardGeorgia Cabinets manufactures kitchen cabinets that are sold to local dealers throughout the Southeast. Because of a large backlog of orders for oak and cherry cabinets, the company decided to contract with three smaller cabinetmakers to do the final finishing operation. For the three cabinetmakers, the number of hours required to complete all the oak cabinets, the number of hours required to complete all the cherry cabinets, the number of hours available for the final finishing operation, and the cost per hour to perform the work are shown here: Cabinetmaker 1 Cabinetmaker 2 Cabinetmaker 3 Hours required to complete all the oak cabinets 50 44 32 Hours required to complete all the cherry cabinets 61 46 34 Hours available 35 25 30 Cost per hour $36 $43 $56 For example, Cabinetmaker 1 estimates that it will take 50 hours to complete all the oak cabinets and 61 hours to complete all the cherry cabinets. However, Cabinetmaker 1 only has 35 hours available for the final…arrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.