optidef
Environments for writing optimization problems
- Version:
- 3.1
- Copyright:
- Jesus Lago Garcia
- License:
- lppl1.3
- Packaged on:
- 04/24/2019 20:11:51
- Number of files:
- 5
- Size on disk:
- 279.72 kB
This small library provides a standard set of environments for writing optimization problems. It automatically aligns the problems in three points with an optional fourth: Beginning of the words “minimize/argmin” and “subject to” The objective function and the longest left hand side of the constraints. 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). Furthermore, 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. Finally, it also allows a definition of any optimization problem without a limitless number of constraints.