Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

A metamodel for optimization problems

Published

Author(s)

Ibrahim Assouroko, Peter O. Denno

Abstract

In mathematics, computer science, and operations research, mathematical optimization is the process of finding best feasible values (oftentimes maxima or minima) of a given objective that is modeled mathematically. This paper introduces the concept of a metamodel for optimization problems and describes an exploratory implementation of such a metamodel. The metamodel is (1) a conceptual model for capturing, in abstract terms, essential characteristics of a given optimization problem, and (2) a schema of sufficient formality to enable the problem modeled to be serialized to statements in a concrete optimization language. The exploratory metamodel presented in this paper addresses a majority of abstractions found in the OPL language. We present prototype software to compile OPL programs to populations of the metamodel and to serialize these populations back to OPL code. The paper describes the motivation for this work and a detailed specification of the exploratory implementation.
Citation
NIST Interagency/Internal Report (NISTIR) - 8096
Report Number
8096

Keywords

metamodel, optimization problem, optimization model specification, Optimization Programming Language, UML

Citation

Assouroko, I. and Denno, P. (2016), A metamodel for optimization problems, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/NIST.IR.8096 (Accessed May 26, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created January 8, 2016, Updated November 10, 2018