| Capability Portfolio Analysis Tool (CPAT) Verification and Validation Report |
Jan 2013 |
77 pages |
| Authors:
Lee Ewing; Robert F Dell; Molly MacCalman; Laura Whitney; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH
|
 | This technical review of the Capability Portfolio Analysis Tool (CPAT) was conducted by the Naval Postgraduate School at the request of the Program Executive Office Ground Combat Systems. The CPAT is intended to support Department of the Army portfolio resourcing and capabilities decisions for the ground combat fleet. The tool is designed to identify the optimum courses of action (cost, schedule, and performance) for portfolio investment. |
|
| Optimally Stationing Army Forces |
Dec 2008 |
16 pages |
| Authors:
Robert F Dell; P L Ewing; William J Tarantino; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH
|
| There are over one million United States active-duty Army, Army National Guard, and Army Reserve soldiers. The Army assigns each soldier to a unit at one of over 4,000 worldwide locations; these facilities consist of approximately 15 million acres and 287 million square feet. The Army can change a soldier's unit assignment; it can also move a unit's home installation. This paper presents an integer linear program, Optimally Stationing Army ... |
|
| Solving the Pallet Loading Problem |
Jan 2008 |
13 pages |
| Authors:
Gustavo H Martins; Robert F Dell; BRAZILIAN NAVY RIO DE JANEIRO
|
| This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. Boxes may be rotated 90 so long as they are placed with edges parallel to the pallet's edges. The set of all PLP instances with an area ... |
|
| The Minimum Size Instance of a Pallet Loading Problem Equivalence Class |
Jan 2007 |
11 pages |
| Authors:
Gustavo H Martins; Robert F Dell; BRAZILIAN NAVY RIO DE JANEIRO
|
| The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90 deg so long as they are packed with edges parallel to the pallet's edges, i.e., in an orthogonal packing. This paper defines the Minimum Size Instance (MSI) of an equivalence class of PLP, and shows that every class has one and only one MSI. We develop bounds on ... |
|
| Formulating Integer Linear Programs: A Rogues' Gallery |
01-Apr-2006 |
14 pages |
| Authors:
Gerald G Brown; Robert F Dell; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH
|
| The art of formulating linear and integer linear programs is, well, an art: It is hard to teach, and even harder to learn. To help demystify this art, we present a set of modeling building blocks that we call "formulettes." Each formulette consists of a short verbal description that must be expressed in terms of variables and constraints in a linear or integer linear program. These formulettes can better be ... |
|
| Optimizing Military Capital Planning |
01-Dec-2004 |
12 pages |
| Authors:
Gerald G Brown; Robert F Dell; ALexandra M Newman; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH
|
| Planning United States military procurement commits a significant portion of our nation s wealth and determines our ability to defend ourselves, our allies, and our principles over the long term. Our military pioneered and has long used mathematical optimization to unravel the distinguishing complexities of military capital planning. The succession of mathematical optimization models we present exhibits increasingly detailed features; such embellishments are always needed for real-world, long-term procurement decision ... |
|
| Optimizing Plant-Line Schedules and an Application at Hidden Valley Manufacturing Company |
01-Jun-2002 |
15 pages |
| Authors:
Gerald G Brown; Robert F Dell; Ray L Davis; Richard H Duff; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH
|
| A plant line schedule specifies a plant's sustained batch operations over time with detail sufficient to manage all activities. Plantwide considerations include restrictions on how production centers can be formed from production lines, packaging lines, conveyers, and so forth; the cost and time of product-package item setups, changeovers, and shutdowns; honoring in-stock service levels, minimum inventory, and committed shipments; recognizing efficiency gains with longer batch runs; respecting crew constraints; and ... |
|
| Valid Integer Polytope (VIP) Penalties for Branch-and-Bound Enumeration |
01-Jan-2000 |
11 pages |
| Authors:
Gerald G Brown; Robert F Dell; Michael P Olson; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH
|
| The authors introduce new penalties, called valid integer polytope (VIP) penalties, that tighten the bound of an integer-linear program during branch-and-bound enumeration. Early commercial codes for branch and bound commonly employed penalties developed from the dual simplicial lower bound on the cost of restricting fractional integer variables to proximate integral values. VIP penalties extend and tighten these for ubiquitous k-pack, k-partition, and k-cover constraints. In real-world problems, VIP penalties occasionally ... |
|
| How US Air Force Space Command Optimizes Long-Term Investment in Space Systems |
|
15 pages |
| Authors:
Gerald G Brown; Robert F Dell; Heath Holtz; ALexandra M Newman; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH
|
| United States Air Force Space Command spends billions of dollars each year acquiring and developing launch vehicles and space systems. The space systems in orbit must continually meet defensive and offensive requirements and remain interoperable over time. Space Command can launch additional space systems only if it has a launch vehicle of sufficient capability. Space planners using space and missile optimization analysis (SAMOA) consider a 24-year time horizon when determining ... |
|
Reports by Author
