Concept explainers
a)
To solve: The linear programming problem and answer the given questions.
Introduction:
Linear programming:
Linear programming is a mathematical modelling method where a linear function is maximized or minimized taking into consideration the various constraints present in the problem. It is useful in making quantitative decisions in business planning.
a)
Explanation of Solution
Given information:
Calculation of coordinates for each constraint and objective function:
Constraint 1:
Constraint 2:
Objective function:
The problem is solved with iso-profit line method.
Graph:
(1) Optimal value of the decision variables and Z:
The coordinates for the profit line is (6, 8). The profit line is moved away from the origin. The highest point at which the profit line intersects in the feasible region will be the optimum solution. The following equation are solved as simultaneous equation to find optimum solution.
Solving (1)and (2)we get,
The values are substituted in the objective function to find the objective function value.
Optimal solution:
(2)
None of the constraints are having slack. Both the ≤ constraints are binding.
(3)
There are no ≥ constraints. Hence, none of the constraints have surplus.
(4)
There are no redundant constraints.
b)
To solve: The linear programming problem and answer the questions.
Introduction:
Linear programming:
Linear programming is a mathematical modelling method where a linear function is maximized or minimized taking into consideration the various constraints present in the problem. It is useful in making quantitative decisions in business planning.
b)
Explanation of Solution
Given information:
Calculation of coordinates for each constraint and objective function:
Constraint 1:
Constraint 2:
Constraint 3:
Objective function:
The problem is solved with iso-profit line method.
Graph:
(1) Optimal value of the decision variables and Z:
The coordinates for the profit line is (10, 2). The profit line is moved away from the origin. The highest point at which the profit line intersects in the feasible region will be the optimum solution. The following equations are solved as simultaneous equation to find optimum solution.
Solving (1)and (2)we get,
The values are substituted in the objective function to find the objective function value.
Optimal solution:
(2)
None of the constraints are having slack. The time constraint has ≤ and it is binding.
(3)
Durability and strength constraints have ≥ in them. The durability constraint is binding and has no surplus. The strength constraint has surplus as shown below:
The surplus is 15 (39 -24).
(4)
There are no redundant constraints.
c)
To solve: The linear programming problem and answer the questions.
Introduction:
Linear programming:
Linear programming is a mathematical modelling method where a linear function is maximized or minimized taking into consideration the various constraints present in the problem. It is useful in making quantitative decisions in business planning.
c)
Explanation of Solution
Given information:
Calculation of coordinates for each constraint and objective function:
Constraint 1:
Constraint 2:
Constraint 3:
Objective function:
The problem is solved with iso-profit line method.
Graph:
(1) Optimal value of the decision variables and Z:
The coordinates for the profit line is (20, 40). The profit line is moved away from the origin. The highest point at which the profit line intersects in the feasible region will be the optimum solution. The following equation are solved as simultaneous equation to find optimum solution.
Solving (1) and (2) we get,
The values are substituted in the objective function to find the objective function value.
Optimal solution:
(2)
The material and machinery constraint has ≤ and it is binding and has zero slack. The labor constraint has slack as shown below:
The slack is 120 (1,200 – 1,080).
(3)
There are no constraints with ≥. Hence, no constraints have surplus.
(4)
There are no redundant constraints
Want to see more full solutions like this?
Chapter 19 Solutions
Loose Leaf for Operations Management (The Mcgraw-hill Series in Operations and Decision Sciences)
- I need to forecast using a 3-Period-Moving-Average-Monthly forecasting model which I did but then I need to use my forecast numbers to generate a Master Production Schedule (MPS) I have to Start with actual sales (my own test data numbers) for August-2022 Oct-2022 i need to create MPS to supply demand starting November-2022 April 2023 I just added numbers without applying formulas to the mps on the right side of the spreadsheet because I do not know how to do it. The second image is the example of what it should look like. Thank You.arrow_forwardSolve the following Question 1. How do volume and variety affect the process selection and layout types? Discuss 2. How is the human resource aspect important to operation function? Discuss 3. Discuss the supply network design and its impact on the overall performance of the organization.arrow_forwardHelp with question?arrow_forward
- What are some good examples of bullet points on a resume for a Christian Elementary School?arrow_forwardWhat is an example of a cover letter for a Christian School Long-Term Substitute Teaching position?arrow_forwardThe supply chain is a conventional notion, but organizations are only really interested in making products that they can sell to customers. Provided they have reliable supplies of materials and reasonable transport for finished products, logistics is irrelevant. Do you think this is true? If yes, explain, and if no, clearly explain as well.arrow_forward
- working as a program operations managerarrow_forward12 X1, X230 1 x =0x2 write the Following linear Programming model by 1- general Form Canonical Forms Canonical formY 2- Standard Form Max Z=35X+ 4 X 2 +6 X3 ST. X+2X2-5x3 = 40 3X, + 6X2 + 7x 3 = 30 7x, +lox2 x3 = 50 X3 X 2 X 3 <0arrow_forwarda/ a Minimum cost assign each worker for one job at Jobs J1 12 33 WI 2 4 6 W2 5 W3 5 33 6 7arrow_forward
- وبة واضافة هذه القيمة الى القيم Ex: Assign each job for each worker at minimum total Cost عمل لكل عامل وبأقل كلفة ممكنة obs الأعمال Workors العمال J1 J2 J3 J4 W₁ 15 13 14 12 W2 11 12 15 13 W3 13 12 10 11 W4 15 17 14 16arrow_forwardThe average completion time (flow time) for the sequence developed using the FCFS rule = 11.75 days (round your response to two decimal places). The percentage utilization for the sequence developed using the FCFS rule = 42.55 % (enter your response as a percentage rounded to two decimal places). b) Using the SPT (shortest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): An Alabama lumberyard has four jobs on order, as shown in the following table. Today is day 205 on the yard's schedule. In what sequence would the jobs be ranked according to the decision rules on the left: Job Due Date A 212 B 209 C 208 D 210 Duration (days) 6 3 3 8 Sequence 1 Job B 2 3 4 A D The average tardiness (job lateness) for the sequence developed using the SPT rule = 5.00 days (round your response to two decimal places). The average completion time (flow time) for the sequence developed using the SPT rule = 10.25 days…arrow_forwardWith the aid of examples, fully discuss any five (5) political tactics used in organisations.arrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,