skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming

Abstract

A method for finding a global optimum to the on-off minimum-time control problem with limited fuel usage is presented. Each control can take on only three possible values: maximum, zero, or minimum. The simplex method for linear systems naturally yields such a solution for the re-formulation presented herein because it always produces an extreme point solution to the linear program. Numerical examples for the benchmark linear flexible system are presented.

Authors:
Publication Date:
Research Org.:
Sandia National Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)
Sponsoring Org.:
US Department of Energy (US)
OSTI Identifier:
13988
Report Number(s):
SAND99-2317C
TRN: AH200135%%572
DOE Contract Number:  
AC04-94AL85000
Resource Type:
Conference
Resource Relation:
Conference: American Control Conference, 2000, Chicago, IL (US), 06/28/2000--06/30/2000; Other Information: PBD: 1 Sep 1999
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; BENCHMARKS; LINEAR PROGRAMMING; FUEL CONSUMPTION

Citation Formats

DRIESSEN,BRIAN. On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming. United States: N. p., 1999. Web.
DRIESSEN,BRIAN. On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming. United States.
DRIESSEN,BRIAN. Wed . "On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming". United States. https://www.osti.gov/servlets/purl/13988.
@article{osti_13988,
title = {On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming},
author = {DRIESSEN,BRIAN},
abstractNote = {A method for finding a global optimum to the on-off minimum-time control problem with limited fuel usage is presented. Each control can take on only three possible values: maximum, zero, or minimum. The simplex method for linear systems naturally yields such a solution for the re-formulation presented herein because it always produces an extreme point solution to the linear program. Numerical examples for the benchmark linear flexible system are presented.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {1999},
month = {9}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: