A Temporal Cascade Approach for Staircase Liner Programs with an Application to Air Force Mobility Optimization,

Abstract

This research outlines a method by which a staircase linear program that optimizes decisions over a finite time horizon can be approximated and bounded. A feasible solution is derived by a Temporal Cascade Heuristic, which sequentially solves overlapping subsets of the model's time periods. In turn, that approximation is bounded by a Lagrangian Cascade, which penalizes infeasibility by incorporating dual information provided by the heuristic's solution. A large temporal LP developed for USAF mobility planners provides the case study for the method's development. Early results from the Temporal Cascade Heuristic show the feasible solution to be of good quality, although the Lagrangian Cascade bounding scheme has not yet been implemented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 06, 1997
Accession Number
ADA324621

Entities

People

  • Steven F. Baker

Organizations

  • Air Force Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Aircraft Seats
  • Aircrafts
  • Algorithms
  • Availability
  • Deployment
  • Infrastructure
  • Inventory
  • Linear Programming
  • Mobility
  • Operating Systems
  • Operations Research
  • Optimization
  • Reliability
  • Scheduling (Production)
  • Vehicles

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Aerodynamics.
  • Ocean-Atmosphere Mesoscale Modeling, Data Assimilation, and Flux Boundary Layers