# Difference between revisions of "MINOTAUR"

From Minotaur

m (→Introduction) |
|||

Line 8: | Line 8: | ||

| subject to || <math>g_i(x,y) \leq 0 \,</math> || for <math>i = 1, ..., m \,</math> | | subject to || <math>g_i(x,y) \leq 0 \,</math> || for <math>i = 1, ..., m \,</math> | ||

|- | |- | ||

− | | || <math> x \in X \; y \in Y</math> integer || | + | | || <math> x \in X \; y \in Y</math> integer, || |

|} | |} | ||

where <math>f(x,y), g_i(x,y)</math> are smooth functions of the continuous variables <math>x</math> and the integer variables <math>y</math>. | where <math>f(x,y), g_i(x,y)</math> are smooth functions of the continuous variables <math>x</math> and the integer variables <math>y</math>. |

## Latest revision as of 22:39, 2 November 2011

Welcome to the MINOTAUR wiki page.

## Introduction

MINOTAUR is a toolkit for solving mixed-integer nonlinear optimization problems of the form

minimize | ||

subject to | for | |

integer, |

where are smooth functions of the continuous variables and the integer variables .