Plausible optima

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a framework and specific algorithms for screening a large (perhaps countably infinite) space of feasible solutions to generate a subset containing the optimal solution with high confidence. We attain this goal even when only a small fraction of the feasible solutions are simulated. To accomplish it we exploit structural information about the space of functions within which the true objective function lies, and then assess how compatible optimality is for each feasible solution with respect to the observed simulation outputs and the assumed function space. The result is a set of plausible optima. This approach can be viewed as a way to avoid slow simulation by leveraging fast optimization. Explicit formulations of the general approach are provided when the space of functions is either Lipschitz or convex. We establish both small- and large-sample properties of the approach, and provide two numerical examples.

Original languageEnglish (US)
Title of host publicationWSC 2018 - 2018 Winter Simulation Conference
Subtitle of host publicationSimulation for a Noble Cause
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1981-1992
Number of pages12
ISBN (Electronic)9781538665725
DOIs
StatePublished - Jan 31 2019
Event2018 Winter Simulation Conference, WSC 2018 - Gothenburg, Sweden
Duration: Dec 9 2018Dec 12 2018

Publication series

NameProceedings - Winter Simulation Conference
Volume2018-December
ISSN (Print)0891-7736

Conference

Conference2018 Winter Simulation Conference, WSC 2018
CountrySweden
CityGothenburg
Period12/9/1812/12/18

Fingerprint

Function Space
Confidence
Screening
Lipschitz
Optimality
Simulation
Objective function
Optimal Solution
Numerical Examples
Subset
Optimization
Formulation
Output
Framework

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Computer Science Applications

Cite this

Plumlee, M., & Nelson, B. L. (2019). Plausible optima. In WSC 2018 - 2018 Winter Simulation Conference: Simulation for a Noble Cause (pp. 1981-1992). [8632297] (Proceedings - Winter Simulation Conference; Vol. 2018-December). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WSC.2018.8632297
Plumlee, Matthew ; Nelson, Barry L. / Plausible optima. WSC 2018 - 2018 Winter Simulation Conference: Simulation for a Noble Cause. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 1981-1992 (Proceedings - Winter Simulation Conference).
@inproceedings{d7d976251632440987ef2f2370600c4e,
title = "Plausible optima",
abstract = "We propose a framework and specific algorithms for screening a large (perhaps countably infinite) space of feasible solutions to generate a subset containing the optimal solution with high confidence. We attain this goal even when only a small fraction of the feasible solutions are simulated. To accomplish it we exploit structural information about the space of functions within which the true objective function lies, and then assess how compatible optimality is for each feasible solution with respect to the observed simulation outputs and the assumed function space. The result is a set of plausible optima. This approach can be viewed as a way to avoid slow simulation by leveraging fast optimization. Explicit formulations of the general approach are provided when the space of functions is either Lipschitz or convex. We establish both small- and large-sample properties of the approach, and provide two numerical examples.",
author = "Matthew Plumlee and Nelson, {Barry L}",
year = "2019",
month = "1",
day = "31",
doi = "10.1109/WSC.2018.8632297",
language = "English (US)",
series = "Proceedings - Winter Simulation Conference",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1981--1992",
booktitle = "WSC 2018 - 2018 Winter Simulation Conference",
address = "United States",

}

Plumlee, M & Nelson, BL 2019, Plausible optima. in WSC 2018 - 2018 Winter Simulation Conference: Simulation for a Noble Cause., 8632297, Proceedings - Winter Simulation Conference, vol. 2018-December, Institute of Electrical and Electronics Engineers Inc., pp. 1981-1992, 2018 Winter Simulation Conference, WSC 2018, Gothenburg, Sweden, 12/9/18. https://doi.org/10.1109/WSC.2018.8632297

Plausible optima. / Plumlee, Matthew; Nelson, Barry L.

WSC 2018 - 2018 Winter Simulation Conference: Simulation for a Noble Cause. Institute of Electrical and Electronics Engineers Inc., 2019. p. 1981-1992 8632297 (Proceedings - Winter Simulation Conference; Vol. 2018-December).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Plausible optima

AU - Plumlee, Matthew

AU - Nelson, Barry L

PY - 2019/1/31

Y1 - 2019/1/31

N2 - We propose a framework and specific algorithms for screening a large (perhaps countably infinite) space of feasible solutions to generate a subset containing the optimal solution with high confidence. We attain this goal even when only a small fraction of the feasible solutions are simulated. To accomplish it we exploit structural information about the space of functions within which the true objective function lies, and then assess how compatible optimality is for each feasible solution with respect to the observed simulation outputs and the assumed function space. The result is a set of plausible optima. This approach can be viewed as a way to avoid slow simulation by leveraging fast optimization. Explicit formulations of the general approach are provided when the space of functions is either Lipschitz or convex. We establish both small- and large-sample properties of the approach, and provide two numerical examples.

AB - We propose a framework and specific algorithms for screening a large (perhaps countably infinite) space of feasible solutions to generate a subset containing the optimal solution with high confidence. We attain this goal even when only a small fraction of the feasible solutions are simulated. To accomplish it we exploit structural information about the space of functions within which the true objective function lies, and then assess how compatible optimality is for each feasible solution with respect to the observed simulation outputs and the assumed function space. The result is a set of plausible optima. This approach can be viewed as a way to avoid slow simulation by leveraging fast optimization. Explicit formulations of the general approach are provided when the space of functions is either Lipschitz or convex. We establish both small- and large-sample properties of the approach, and provide two numerical examples.

UR - http://www.scopus.com/inward/record.url?scp=85062626558&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062626558&partnerID=8YFLogxK

U2 - 10.1109/WSC.2018.8632297

DO - 10.1109/WSC.2018.8632297

M3 - Conference contribution

T3 - Proceedings - Winter Simulation Conference

SP - 1981

EP - 1992

BT - WSC 2018 - 2018 Winter Simulation Conference

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Plumlee M, Nelson BL. Plausible optima. In WSC 2018 - 2018 Winter Simulation Conference: Simulation for a Noble Cause. Institute of Electrical and Electronics Engineers Inc. 2019. p. 1981-1992. 8632297. (Proceedings - Winter Simulation Conference). https://doi.org/10.1109/WSC.2018.8632297