Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 4.17, Problem 5P

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 programming is to be formulated and using the solver add in excel, the number of sailboats during each quarter is to be determined.

Let,

xt= Number of sailboats produced by regular time labour (at $400 pre boat) during quarter t where t=1,2,3,4.

yt= Number of sailboats produced by overtime time labour (at $450 per boat) during quarter t where, t=1,2,3,4.

it= Number of sailboats on hand at the end of quarter t where, t=1,2,3,4.

Sailco’s total cost can be determined as follows.

 Cost=Cost of producing regular time boats + Cost of producing overtime boats + inventory costs=400(x1+x2+x3+x4)+450(y1+y2+y3+y4)+20(i1+i2+i3+i4)

Since the total cost to be minimized, the objective function of Sailco is given below,

Minimize, z=400(x1+x2+x3+x4)+450(y1+y2+y3+y4)+20(i1+i2+i3+i4)

The constraints are given below,

For each period’s regular time production will not exceed 40. So the below given constraints are obtained.

x140x240x340x440

Also suppose that,

Inventory at the end of quarter t= Inventory at the end of quarter(t-1)                                                     +quarter t production – quarter t demand

This means,

it=it-1+(xt+yt)-di where, (t=1,2,3,4)

When submitting the values, the following constraints are obtained.

i1=10+x1+y1-40i2=i1+x2+y2-60i3=i2+x2+y3-75i4=i3+x4+y4-25

Also, it(t=1,2,3,4) implies that each quarter’s demand is met on time and xt0 implies that the production levels are positive at all time

Blurred answer
Students have asked these similar questions
Solve the following problem and find the optimal solution.
Solve the following LP optimization problem using the simplex method: maximize 40x + 30 subject to x + y <= 12, 2x + y <= 16 x >= 1 , y >= 0
Use the Simplex approach to solve the following LP problem:             Maximize       z =       3 X1    +      X2             Subject to:                    2 X1    +      4X2 < 6                                                 5 X1   +     10X2 < 25                                               − 1 X1 > − 2                                                                  2 X2   ≤ 4                                                 and X1, X2 > 0.

Chapter 4 Solutions

Operations Research : Applications and Algorithms

Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole