1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
# optidef
Optidef is a small library that provides a standard set of environments for writing optimization problems.
## Features:
The most important features are:
- It automatically aligns the problems in the most convenient way allowing even two different output formats:
* Beginning of the words "minimize/argmin" and "subject to"
* Double format for the location of the constraints: either to the right of subject to aligned with the objective function or below subject to.
* The $= | > | <$ signs of the constraints.
* Optionally, the user can add manually a double align character \&\& to align some common constraints feature. A clear example could be the constraints names, e.g. (boundary constraint) alignment with (dynamic constraint), or the index of the constraints, e.g. in the case of having something like $h(x_k,u_k)\leq 0,\quad k=0,\ldots,N$, align the indexes $k=0,\ldots,N$ across constraint lines.
- It provides an easy interface to define optimization problem for three different reference situations:
* Where no equation is referenced/numbered.
* Where the problem is referenced with a single number.
* Where each equation has an individual reference.
- It also allows a definition of any optimization problem without a limitless number of constraints.
- It defines four types of optimization problems:
* minimize
* maximize
* arg mini
* arg maxi
## Syntax:
The syntax to define an optimization problem is given by:
>\begin{mini#}[Format]
{Optimization variable}
{Objective function \label{Objective function referece}}
{\label{Global referece of Optimization Problem}}
{Result of the optimization problem or any expression on the left of the minimize word}
\addConstraint{LHS Constraint 1}{RHS Constraint 1 \label{Reference Constraint 1}}
\addConstraint{LHS Constraint 2}{RHS Constraint 2 \label{Reference Constraint 2}}
.
.
\addConstraint{LHS N} {RHSConstraint N \label{Reference Constraint N}}
\end{mini#}
where mini# takes any of the following values:
- mini\* for no referencing
- mini! for referencing each equation
- mini for referencing with a single label the whole problem.
Notice that only the first two parameters will be really necessary in every definition, nevertheless and for the sake of having homogeneous definitions, we opted for requiring the 4 parameters in every definition and expecting empty parameters definitions, i.e. \{\}, when they are not needed.
After the definition of this parameters, the environment accepts the definition of an infinite number of constraints.
Finally note that \begin{mini#} can be substituted by \begin{maxi#}, \begin{argmini#} or \begin{argmaxi#}.
## Contact:
E-mail: jesus.lago.garcia@venus.uni-freiburg.de
## Licensing:
Copyright 2016 Jesus Lago Garcia
This work may be distributed and/or modified under the conditions of the LaTeX Project Public License, either version 1.3 of this license or (at your option) any later version.
The latest version of this license is in http://www.latex-project.org/lppl.txt and version 1.3 or later is part of all distributions of LaTeX version 2005/12/01 or later.
This work has the LPPL maintenance status 'maintained'. The Current Maintainer of this work is J. Lago Garcia, under the supervision of Prof. Dr. Moritz Diehl and Prof. Dr. Sebastien Gross.
This work consists of the file optidef.sty.
|
