| Excel Companion Chapter 5 |
Chapter 5 Index
| EC_5 | |||
| MaxVolum.xls | |||
| ClsscMin.xls | Three Classical
Minimization Problems
|
||
| PointMP.xls | |||
| EOQ.xls | |||
| Ordering and Holding Cost, Total Cost with Discount | |||
| Response.xls | |||
![]()
Certain classical non-linear optimization
problems are related to common two and three dimensional
geometric shapes, such as rectangles, boxes, cylinders, or cones.
Your objective will be to maximize or minimize some function
which may represent an area, volume, or cost of building some two
or three dimensional object. Frequently there is some condition
that you must satisfy, such as the three dimensional shape must
have a fixed volume or the amount of money to enclose the two
dimensional shape is fixed. Usually the hardest part is to create
the function to be optimized in terms of a single independent
variable. For these classical geometric problems, an important
first step is to draw a picture and label it with as few
variables as possible.
In the first part of this chapter you will investigate and solve one maximization problem in Maxvolum.xls and three classic minimization problems in ClsscMin.xls. Each of the minimization models are three dimensional and include a condition ( constraint) that requires a box or cylinder to contain a fixed volume measured in cubic units.
| Maximum Volume of an Open Box | Maxvolum.xls |
Open the file Maxvolum.xls.
| SITUATION: A flat sheet
of cardboard is to be shaped into an open box by cutting
identical squares from the four corners and then folding
up the sides. The objective is to make the box which has
the greatest volume. Suppose we start with a flat sheet
which has dimensions 8.5 by 11 inches. If we remove
squares with 2 inch sides from each corner, then the box
will have volume V(2) = (8.5 - 4)*(11-4)*2 = 63 cubic inches. Will this box have the greatest possible volume? |
|
![]()
Copyright © Joseph F. Aieta, Babson
College 1997