Concept explainers
Explanation of Solution
Finding optimal solution:
The demand for sail boats during each of the next four quarters is;
First quarter-40 sailboats
Second quarter-60 sailboats
Third quarter- 75 sailboats
Fourth quarter- 25 sailboats
An inventory of 10 sailboats is at the beginning of the first quarter. Also, it is assumed that sailboats manufactured during a quarter can be used to meet demand for that quarter.
Also, during each quarter, Sailco can produce up to 40 sailboats with total cost of $400 per sailboat.
Additional sailboats with overtime labor can be produced at a total cost of $450 per sailboat.
A carrying cost of $20 per sailboat is incurred at the end of each quarter. A production schedule to minimize the sum of production and inventory costs during the next four quarters using linear
Let,
Sailco’s total cost can be determined as follows.
Since the total cost to be minimized, the objective function of Sailco is given below,
Minimize,
The constraints are given below,
For each period’s regular time production will not exceed 40. So the below given constraints are obtained.
Also suppose that,
This means,
When submitting the values, the following constraints are obtained.
Also,
Want to see the full answer?
Check out a sample textbook solutionChapter 4 Solutions
Introduction to mathematical programming
- DPP. Solve by backward recursive equation defining its stages in order to find the optimal solutionarrow_forwardQuestion 14 of 20: Set the best anas 14 Use Gauss-Jordan elimination to solve the following linear system: -3x+4y=-6 5x-y=10 OA (2.0) 08.2-5 OCHED ⒸD. (22) Mark for revine (Will be highlighted on the review page) s Gutxarrow_forwardRounding the solution of a linear programming problem to the nearest integer values provides a(n): a. integer solution that is optimal. b. integer solution that may be neither feasible nor optimal. c. feasible solution that is not necessarily optimal. d. infeasible solution.arrow_forward
- Question 14 of 20: Set the best anas 14 Use Gauss-Jordan elimination to solve the following linear system: -3x+4y=-6 5x-y=10 OA (2.0) 08.2-5 OCHED ⒸD. (22) Mark for revine (Will be highlighted on the review page) s Guinarrow_forwardSolve example 2arrow_forwardQuestion 16 1 pts Let X and Y be two problems. If X is polynomial-time reducible to Y, which of the following is true? If X can be solved in polynomial time, then Y can be solved in polynomial time. O If Y can be solved in polynomial time, then X can be solved in polynomial time. O X is harder than Y O If Y cannot be solved in polynomial time, then X cannot be solved in polynomial time.arrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole