Storage Systems Layout

FACPLAD Notes
Definition of Storage
 Storage is an essential function in a
warehouse.
 It refers to the physical containment of

merchandise while it is awaiting a demand.

 Design Issues
on Storage Systems
 Size of the storage system
 Storage method
 Layout of storage system
 Decision Requirements on
Storage System
 No. of storage location required
 Method of storing/retrieving

products
 Assignment of items to locations
 Definition of Terms
 Throughput - a measure of the activity or
the dynamic nature of storage. It used to
measure the number of storages and
retrievals performed per time period.
 Size - Refers to the storage space needed.

This is influenced by the storage,

throughput, cost parameters, storage
method, storage layout.
Throughput Size
 Definition of Terms
 Cost parameters - these include the cost
of providing storage versus the cost of not
providing storage.
 Cost of providing storage space - includes the
costs associated with space, personnel, and
equipment resources.
 Cost of not providing storage space - includes
the costs of leasing space or contracting public
warehouse. Reflects the impact of shortage due
to inadequate space.
 Definition of Terms
 Storage Method - includes the specification
of the unit load and/or container to be
stored, handled, and controlled, as well as
the storage/retrieval device, storage
equipment, and other material handling
equipment.
 Storage System Layout - includes the
height, length, and width of storage, the
location of individual items in storage, and
the location and configuration of any
required support functions.
Relationship of
Size and Policy

Size of Storage
Requirement

No. of Storage
Locations Required

Storage Location
Policy
 Storage Location Policies
 Dedicated Storage
 Randomized Storage
 Class-based Dedicated Storage
 Shared Storage
 Dedicated Storage
Location Policy
 Referred to as fixed slot storage.
 Involves that assignment of specific

locations for each product stored.

 Part Number Sequence Storage - the

storage location of a product is based

solely on the part number assigned to it.
Low part numbers are assigned to the
“best” locations. The higher the part
number, the less desirable is its location.
 Space Requirements
 For Dedicated storage, one and only one
product is assigned to a storage location.
 The number of storage locations assigned

to a product must be capable of satisfying

the maximum storage requirement for the
product.
 For multi-product, the storage space

required equals the sum of the maximum

storage requirements for each product.
Problem 1:
 A warehouse stores four products (1,2,3,4).
Daily demand and replenishment quantities
for four products are given in the table
below. Replenishments are staggered and
the lead time is assumed at one day. The
beginning inventory for each product is 8,
10, 2 and 5, respectively. Determine the
number of storage location for each product
using Dedicated Storage Location Policy.
Problem 1 (Cont.)
Product Daily Demand Replenishment
(pallet loads) Quantity (pallet
loads)
1 2 8
2 5 40
3 2 12
4 1 12
Solution
Time Period Product 1 Product 2 Product 3 Product 4
1 8 10 2 5
2 6 5 12 4
3 4 40 10 3
4 2 35 8 2
5 8 30 6 1
6 6 25 4 12
7 4 20 2 11
8 2 15 12 10
9 8 10 10 9
10 6 5 8 8
11 4 40 6 7
12 2 35 4 6
13 8 30 2 5
14 6 25 12 4
15 4 20 10 3
16 2 15 8 2
17 8 10 6 1
18 6 5 4 12
19 4 40 2 11
20 2 35 12 10
21 8 30 10 9
22 6 25 8 8
23 4 20 6 7
24 2 15 4 6
Maximum 8 40 12 12
Solution
 Total no. of storage locations:

Product No. of
locations
1 8
2 40
3 12
4 12
TOTAL 72
 Sizing on the Basis
of Service Levels

 Service Level refers to the capability of

the system to store items that minimizes
probability of shortage of space.

Pr(1 or more shortages)  1  Pr(no shortages)

n

Pr(no shortages)   Pr(no shortagesfor product j)

j1
 Sizing on the Basis
of Service Levels

Pr(no shortages)   F (Q )
j1 j j

Pr(1 or more shortages)  1   F (Q )

j1 j j
Problem 2
 A certain warehouse stores five products
(1,2,3,4,5). Suppose that the number of
storage slot required for each product per
day follows normal distribution. The mean
and standard deviation are given in the
table below. Assume that the company is
aiming for 0.98778 service level for
individual product. Determine the number
storage slots for each product. What is the
probability that there will be at least 1
shortage of space?
Problem 2 (Cont.)

Product Mean Standard

Deviation
1 30 slots 8 slots
2 40 slots 10 slots
3 50 slots 15 slots
4 50 slots 12 slots
5 40 slots 12 slots
Solution
Q j  M J  z j SD j

Where: Mj = mean daily demand for storage,

measured in storage slots
SDj = standard deviation of daily demand for
storage, measured in storage slots
Zj = parameter for a standard normal
distribution that provides the desired probability
of sufficient storage capacity.
Solution
Q1 = 30 + 2.25(8) = 48 slots
Q2 = 40 + 2.25(10) = 62.5 slots
Q3 = 50 + 2.25(15) = 83.75 slots
Q4 = 50 + 2.25(12) = 77 slots
Q5 = 40 + 2.25(12) = 67 slots
 Therefore, the number of storage slots for
product 1, 2, 3, 4, and 5 are 48, 63, 84, 77,
and 67, respectively. The total number of
storage slots is 339.

Pr(x>1) = 1 – (0.98778)5 = 0.0596

Mathematical Model #1

Min  Q
j 1
j

s.t .  F (Q )  P
j1 j j

Q  0 for all j
j
Mathematical Model #2

Max  F (Q ) j1 j j

s.t .  Q  S
j1
j

Q  0 for all j
j
Problem 3
 A storage system is to be designed for storing three
products: 1, 2, and 3. The number of storage slots
required on any given day is a Poisson distributed
random variable. The storage requirements for the
three products are statistically independent. The
expected values of the daily space requirements are
2, 3, and 4. It is desired to minimize the total space
capacity, subject to the probability of at least one
shortage occurring being no greater than 0.05.
Formulate the mathematical model for this problem.
Determine the optimal number of storage locations
for each product and the probability that there will
be no shortages.
Mathematical Model
Min z  Q1  Q2  Q3
s.t.
 𝑃 ( 𝑥1 ≤ 𝑄 1 ) ∗ 𝑃 ( 𝑥 2 ≤ 𝑄 2 ) ∗ 𝑃 ( 𝑥 3 ≤ 𝑄 3 )≥ 0.95

Qj  0 j  1,2,3
Qj
e  x
Where: P( x j  Q j )  
x 0 x!
Solution
 This problem can be solved using dynamic
programming or complete enumeration.
Stage: Product
State: Service Level
Decision: No. of slots to be assigned to each
product
 The allocation of 20 slots that yields the

smallest shortage probability will be 5, 7,

and 8 slots. The probability of space
shortage is 0.049 (1-0.9510).
Solution
Solution

The minimum value is 5 The maximum value is 9

since at that level the since at that level the
probability of no shortage probability of no shortage
is already at least 0.95. is already 100%.

Set the initial service level

to 100% since no
allocation has been made

Set the initial service level

to 100% since no
allocation has been made
Solution These were computed by
adding x2 and f*3(s3,x3). A cell
must have a value if the
service level considering
stages 2 and 3 is at least 0.95.

These were derived by

multiplying the service level at
stage 1 by the probability if x1
slots are allocated to product
1.
 These were derived by

Solution multiplying the service level at

stage 2 by the probability if x2
slots are allocated to product
2.
Solution
Problem 4
 Considering the same problem in no. 3,
suppose that the aggregate capacity of 15 is
available. Formulate the mathematical
model for this problem. How would the
storage space be allocated among the
products if it is desired to minimize the
probability of space shortages?
Mathematical Model

 𝑀𝑎𝑥 𝑧 = 𝑃 ( 𝑥1 ≤ 𝑄 1 ) ∗ 𝑃 ( 𝑥 2 ≤ 𝑄 2 ) ∗ 𝑃 ( 𝑥 3 ≤ 𝑄 3 )

s.t. Q1  Q2  Q3  15

Qj  0 j  1,2,3
Qj
e  x
Where: P( x j  Q j )  
x 0 x!
Solution
 This problem can be solved using dynamic
programming or complete enumeration.
Stage: Product
State: Available slots
Decision: No. of slots to be assigned to each
product
Solution
 The allocation of 15 slots that yields the
greatest probability of no space shortages
will be 4, 5 and 6 for products 1, 2, and 3,
respectively.
 The probability of no shortages is (0.9473)

(0.9161)(0.8893) or 0.7718.
Solution

These were derived by

multiplying the service level at
stage 1 by f*2(s2,x2), where
s2=s1-x1
Solution
These were derived by
multiplying the service level at
stage 2 by f*3(s3,x3), where
s3=s2-x2
Solution
These were derived from the
service level (Poisson table) at
stage 3.
Solution
 Sizing on the Basis of Costs

Min TC Q , , Q  
1 n


    
C0Q j   C1,t min  d t , j , Q j   C2,t max  d t , j  Q j ,0   
n T


j 1  t 1 
 Notations
Where: Qj= “owned” storage capacity for product j
T = length of the planning horizon in time periods
dt,j= storage space required for product j during period t
TC(Q1,...,Qn) = total cost over the planning horizon as a
function of the set of storage capacities
C0 = discounted present worth cost per unit storage
capacity owned during the planning horizon of T time periods
C1,t = discounted present worth cost per unit stored in
owned space during time period t
C2,t = discounted present worth cost per unit stored in
leased space or per unit of space shortage during time period
t
Notations
Min(dt,j,Qj) = dt,j if dt,j< Qj
= Qj if dt,j > Qj
Max(dt,j- Qj, 0) = 0 if dt,j- Qj< 0
= dt,j- Qj if dt,j- Qj > 0
Solution Procedures

C'  C /(C  C )
0 2 1

Let
1. Sequence in decreasing order the
demands for space.
2. Sum the demand frequencies over
the sequence.
3. When the partial sum is first equal to
or greater than C’, stop; the optimum
capacity equals that demand level.
Problem 5
 Suppose that only one product is being
stored in the warehouse. Let T = 10 periods,
C0 = $20 per space, C1,t = $1 per space
period, C2,t = $4 per space period, and the
storage requirements over the planning
horizon equals 4, 6, 8, 10, 9, 8 7, 6,5, and 4
for time periods 1 to 10, respectively. The
ordered demands, frequencies, and partial
sum are given in table below.
Solution
Ordered Frequency Partial Sum
Demand
10 1 1 < 6.67
9 1 2 < 6.67
8 2 4 < 6.67 C’ = C0/(C2 – C1)
7 1 5 < 6.67 = 20/(4 – 1) = 6.67
6 2 7 > 6.67
5 1 8 > 6.67
4 2 10 > 6.67

The partial sum exceeds 6.67 when the demand is 6.

Therefore, the optimum capacity is 6. The resulting
cost is $223.
 Stochastic

Min E TC Q , , Q 1 n
 
 T   T  
C0Q j  C1    d t , j p (d t , j )   Q j p (d t , j )  C2     d t , j  Q j  p (d t , j ) 
n


j 1 
 t 1 
 d t , j Q j d t , j Q j  t 1 
 d t , j Q j  
Notations
Where:
E[TC(Q1,...,Qj)] = expected total cost over the planning horizon
as a function of the set of storage capacities
p(dt,j) = probability mass function for the storage requirement
for product j during period t
C1 = cost per unit stored n owned space per time period
C2 = cost per unit stored in leased space or per unit space
shortage per time period
Problem 6
 Suppose a warehouse store only one product.
Let C0 = 25, C1 = 2, C2 =6. The probability
distribution of demand is given in the table
below. Find the number of storage slots
using dedicated storage.
Storage 1 2 3 4 5 6 7 8 9 10
Demand
10 0.30 0.30 0.30 0.30 0.30 - - - - -
15 0.40 0.40 0.40 0.40 0.40 0.20 0.20 0.20 0.20 0.20
20 0.30 0.30 0.30 0.30 0.30 0.30 0.30 0.30 0.30 0.30
25 - - - - - 0.50 0.50 0.50 0.50 0.50
Solution
C’ = C0/(C2 – C1)
= 25/(6 – 2) = 6.25
Storage 1 2 3 4 5 6 7 8 9 10 Sum
Demand
10 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 10.0
15 0.70 0.70 0.70 0.70 0.70 1.00 1.00 1.00 1.00 1.00 8.5
20 0.30 0.30 0.30 0.30 0.30 0.80 0.80 0.80 0.80 0.80 5.5
25 - - - - - 0.50 0.50 0.50 0.50 0.50 2.5

10 Therefore, a storage capacity of size 15

 Fˆt (15)  8.5  6.25 should be provided. A calculation
t 1
establishes that the resulting expected cost
10
 Fˆt (20)  5.5  6.25 will be 900. A capacity of 10 will yield an
t 1 expected cost of 945 and a capacity of 20
will yield an expected cost of 915.
Assigning Products
to S/R Locations
 In a dedicated storage, products are assigned
to S/R locations in an attempt to minimize
the time required to perform the storage and
retrieval operations.
 The time required to perform the operations

is assumed to be dependent on the distance

traveled.
Notations
S = no. of storage slots
N= no. of products to be
stored
M = no. of input/output pts
Sj= storage requirement for
product j, expressed in no.
of storage slots
Tj= throughput reqt
expressed as no. of
storage/retrievals per unit
time
Pi,j= percent of the
storage/retrieval trips for
product j that are from I/O
pt I
Ti,k= time reqd to travel bet
I/O pt I to storage/retrieval
location k
Xj,k = 1, if product j is
assigned to
storage/retrieval location k
F(x) = expected time reqd to
satisfy the throughput reqt
of the system
 Dedicated Storage
Assignment Problem

T
Min f ( x )      p t x 
m n s
j

S
i ,j i ,k j ,k
i  1 j  1 k 1
j

s.t .  x  1 k  1, , s
j 1
j ,k

x  S
k 1
j ,k j
j  1, , n

x  (0,1) for all j and k

j ,k
Solution Procedures
 It is possible to solve the S/R location
assignment problem without utilizing one of
the standard transportation problem
algorithms.
 If the percentage of travel between I/O point i

and the S/R locations is the same for all

products, the following procedure can yield
an optimum solution.
Solution Procedures
 No. the products according to the ratio of
their throughput (Tj) and storage (Sj)
requirements, such that
T T T
 
1 2 n

S S S
 1 2 n

 Compute the t values for all products,

k

where  m

t  p t
k
i 1
i i ,k
Solution Procedures
 Assign product 1 to the
 S1 storage locations
having the smallest tk values; assign
product 2 to the S2 unassigned storage

locations having the next-lowest tk values;
and so on.
Problem 7
 Consider a situation involving six storage locations, two I/O
points, and three products. Consider the storage rack face
shown in the figure. A lift truck travels along the aisle,
stops, and raises and lowers its forks to store and retrieve
unit loads of the product at the indicated (*) locations. The
times required to travel between the I/O points and
storage/retrieval locations are given in the table below. For
example, m = 2, n = 3, and s = 6. Also, we assume that pi,j
= 0.5 for i, j combinations (i.e., the two I/O points are
equally likely to be used for travel to/from the 6
storage/retrieval locations for all products). The number of
storage and retrieval requests to be performed per hour for
the three products are: T1 = 4, T2 = 6, and T3 = 3. Also, the
number of storage positions required for each product are:
S1 = 2 slots, S2 = 1 slot, and S3 = 3 slots.
Example (Cont.)

4 5 6
* * *

1 2 3
I/O1 * * * * * I/O2

Travel Times
i k tik (sec.) i k tik (sec.)
1 1 5 2 1 45
1 2 15 2 2 25
1 3 25 2 3 5
1 4 20 2 4 60
1 5 30 2 5 40
1 6 40 2 6 20
Mathematical Model
Min f ( x)  50 x11  40 x12  3013  80 x14  70 x15  60 x16
 150 x21  120 x22  90 x23  240 x24  210 x25  180 x26
 25 x31  20 x32  15 x33  40 x34  35 x35  30 x36
3
s.t.  x jk  1 k  1,  ,6
j 1

6
 x1k  2
6
 x3k  3
k 1 k 1
6
 x 2k  1 x jk  (1,0) for all j and k
k 1
Solution
1 2 3 4 5 6

1 50 40 30 80 70 60 2
* *

2 150 120 90 240 210 180 1

*

3 25 20 15 40 35 30 3
* * *
1 1 1 1 1 1

T1 4 T2 6 T3 3
 2  6  1
S1 2 S2 1 S3 3


Therefore, we assign location 3 to product since it has lowest value of t k
of 90. We assigned locations 2 and 1 to product 1. Finally, we assign
locations 6, 5, and 4 to product 3.
 Randomized Storage
Location Policy
 Also called as floating slot storage.
 Allows the storage location for a particular
product to change or “float” over time.
 When a load arrives for storage, it is placed in
the “closest” open feasible location; retrievals
occur on a first-in, first-out basis.
 If more than one I/O point, the storage location
selected is the one “closest” to the input point
through which the unit load enters the storage
facility.
 Randomized Storage
Location Policy
 It is assumed that each empty storage slot is
equally likely to be chosen for storage when a
storage operation is performed.
 It is also assumed that each unit of a

particular product is equally likely to be

retrieved when multiple storage location
exists for a product and a retrieval operation
is performed.
Space Requirements
 Storage requirements will equal to the
maximum aggregate storage requirements
for the products.
 Requires less space than Dedicated Storage.
 The reduction in space will be sufficient to

produce travel times less than those resulting

from Dedicated Storage.
Problem 8
 Using problem no.1, determine the storage
slots needed if randomized storage location
policy is used. What is the percentage
decrease in storage requirements as compare
to dedicated storage?
Solution
Time Period Product 1 Product 2 Product 3 Product 4 Aggregate
1 8 10 2 5 25
2 6 5 12 4 27
3 4 40 10 3 57
4 2 35 8 2 47
5 8 30 6 1 45
6 6 25 4 12 47
7 4 20 2 11 37
8 2 15 12 10 39
9 8 10 10 9 37
10 6 5 8 8 27
11 4 40 6 7 57
12 2 35 4 6 47
13 8 30 2 5 45
14 6 25 12 4 47
15 4 20 10 3 37
16 2 15 8 2 27
17 8 10 6 1 25
18 6 5 4 12 27
19 4 40 2 11 57
20 2 35 12 10 59
21 8 30 10 9 57
22 6 25 8 8 47
23 4 20 6 7 37
24 2 15 4 6 27
Maximum 8 40 12 12 59
Solution
 The number of storage slots needed for
randomized storage location policy is based
on the maximum aggregate storage
requirement which is equal to 59 slots.
 The percentage decrease is 18% [(72-59)/72].
Sizing on the Basis
of Service Levels
 Due to the dynamic conditions that typically
exist in the replenishment of products, it is
very difficult to predict exactly the storage
requirements for randomized storage.
 Storage capacity levels are sometimes

established by treating inventory levels of the

product as random variables.
Problem 9
 Using problem no. 2, determine the storage
slots needed for randomized storage policy.
What is the percentage decrease in storage
requirements as compare to dedicated
storage?
Solution
 The mean aggregate number of storage
slots equals the sum of the means for the
five products which is 210 slots.
 Due to the assumed statistical

independence among the products, the

variance for the aggregate number of
storage slots equals the sum of the
variances for the five products which is 677.

 The standard deviation is approximately

equal to 26.02.
Solution
 Recall that the probability of shortage of
storage space is approximately equal to 0.06.
 A shortage probability of 0.06 occurs at a

point on the normal distribution

approximately 1.56 standard deviations above
the mean.
 Therefore, the storage capacity for

randomized storage is 210 + 1.56(26.02) =

251 slots.
 The percentage decrease will be 25.96%.
Problem 10
 Using problem no. 3, determine the storage
slots needed for the three products if
randomized storage is used. Assume the
mean demand for storage space are 10, 15,
and 20 respectively.
Solution
 The aggregate storage requirement is
Poisson distributed with a mean of 45.
Normal distribution will be used to
approximate the Poisson distribution.
 Recall that the mean equals the variance for

the Poisson distribution. The storage level

that yields a shortage probability of 0.05 is
1.645 standard deviations above the mean.
 Therefore, the storage capacity should be

equal to 45 + 1.645(45)0.5 = 56 storage

slots.
 Shared Storage
Location Policy
 This policy is based on industry practice but
has received little research attention.
 This policy attempts to reduce the storage
space needed for Dedicated Storage.
 Over time, different products use the same
storage slot.
 Recognizes and takes advantage of the
inherent differences in lengths of time that
individual pallet loads remain in storage.
 Shared Storage
 Can deliver greater throughput benefits than
either randomized or dedicated storage.
 Shared storage and dedicated storage differ

due to the distinction made by the former

regarding the time that each load of a
product spends in storage.
 Space Requirements
 Space requirements for shared storage range
from that required from randomized storage
to that required for dedicated storage,
depending on the amount of information
available regarding the inventory levels over
time for each product
 Involves total specificity regarding the

storage locations for products.

Problem 11
 Suppose that a production line is used to produce
two product, alpha and beta. The production
schedule call for alpha to be produced uniformly
each of five days on odd-numbered weeks; beta is
similarly produced during even-numbered weeks.
Demand is constant over time and equal to one
pallet load per day for each product. The daily
production rate is two pallet loads, regardless of
the product being produced. Demand occurs
immediately following production and before
storage occurs.
Problem 11 (Cont.)
Solution
 If randomized storage is used, five storage
spaces are required; for dedicated storage,
space must be provided for 10 loads.
Shared storage will require five storage
spaces; however, because of a knowledge of
the time spent in storage for each load, the
assignment of storage locations can be
performed to reduce the average travel time
from that obtained using randomized
storage.
Solution
 The time spent in storage by the kth load
produced is shown in the table below. The
same distribution of times holds for both
products. In Shared storage, assigns the
pallet load having the “shortest stay in
storage” to the “most preferred” location.
Solution

Unit Load Time spent in

produced inventory
(days)
1 0
2 1
3 1
4 2
5 2
6 3
7 3
8 4
9 4
10 5
Solution
End 1 2 3 4 5 End 1 2 3 4 5
of of
day day
1 A1^ B4^ B4 B5 B5 11 A1^ B4^ B4 B5 B5
2 A2^ A2 B4^ B5 B5 12 A2^ A2 B4^ B5 B5
3 A3 A2^ A3 B5^ B5 13 A3 A2^ A3 B5^ B5
4 A3 A4 A3^ A4 B5^ 14 A3 A4 A3^ A4 B5^
5 A3^ A4 A5 A4 A5 15 A3^ A4 A5 A4 A5
6 B1^ A4^ A5 A4 A5 16 B1^ A4^ A5 A4 A5
7 B2^ B2 A5 A4^ A5 17 B2^ B2 A5 A4^ A5
8 B3 B2^ A5^ B3 A5 18 B3 B2^ A5^ B3 A5
9 B3 B4 B4 B3^ A5^ 19 B3 B4 B4 B3^ A5^
10 B3^ B4 B4 B5 B5 20 B3^ B4 B4 B5 B5

^Load to be retrieved at the beginning of the next day.

Since the single load of alpha (A) remains in storage for the
shortest possible period of time, 1 day, we assign it to the most
preferred location, coordinate 1. During period 2, we retrieve
one load of alpha and beta, but we store the two loads of alpha
that were just produced.
Continuous Warehouse Layout
 A set of storage locations can be represented
adequately as a “continuous region”, a set of
positive area, rather than discrete locations.
Reasons for Continuous Warehouse
Layout
 Results from continuous formulations can
provide insights concerning the underlying
discrete problem.
 Many storage problems involve such as large

number of storage locations that continuous

representation is quite appropriate.
 May be easier to solve than the

corresponding discrete problem.

 Storage Region Configuration
 The continuous storage region of a product
can be defined by a contour line.
 The percentage of travel between storage and

I/O points represent the “weights” between

existing and new facilities.
 Contour Lines
 Encloses all points having an expected distance
traveled less than or equal to the value of the
contour line, a set of such points is a level set or
contour set.
 Each contour set, whose boundary is a contour
line, is the set of all points having values of f(x)
longer than those of the points on the contour
line.
 Contour lines and sets can be very useful in
giving geometrical insights into the problem
Problem 12
 Suppose that a randomized storage is to be
used and a storage of 152,000 square feet is
to be provided. Single input/output point is
to be located along the exterior of the
storage facility. Develop a continuous space
configuration.
Solution
A = 152,000 = 1/2bh
= (1/2) (2k) (k)
k = 389.87 ft.

k
k
I/O
k
Problem 13
 Consider a warehouse of dimension 200 ft. x
150 ft. having a single dock. Randomized
storage is to be used. The storage space
required will be either 18,000 or 27,000
square feet. Assume that item movement is
equally likely to occur between the dock and
any point in the storage region. Travel is
rectilinear.
Solution

I/O 200 ft

150 ft.
Solution
A = (1/2)(2k)(k) = k2 0 < k < 100
A + = 200k – 10000 100 < k < 150
= 200 (k – 100)
= (1/2)(200)(100)
A = 30000 – (250 – k)2 150 < k < 250
Solution

Solving for K
Area Triangle Pentagon Hexagon
18,000 134.16 140.00 140.46
27000 164.32 185.00 195.23