# MINOTAUR

From Minotaur

(Difference between revisions)

(→Getting Started with MediaWiki) |
|||

Line 2: | Line 2: | ||

== Introduction == | == Introduction == | ||

− | |||

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

{| align="center" | {| align="center" | ||

Line 11: | Line 10: | ||

| || <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 < | + | 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>. |

## Revision as of 16:25, 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 .