CTAN Update: optidef
Date: December 1, 2016 7:45:33 PM CET
Jesus Lago Garcia submitted an update to the
optidef
package.
Version: 2.3
License: lppl1.3
Summary description: Provides a standard set of environments for writing minimization problems
Announcement text:
Added support to break the objective function in as many lines as necessary. Inside the environment, the user can employ the command \breakObjective{} to add as many lines to the objective as desired.
The package’s Catalogue entry can be viewed at http://www.ctan.org/pkg/optidef The package’s files themselves can be inspected at http://mirror.ctan.org/macros/latex/contrib/optidef/
Thanks for the upload. For the CTAN Team Petra Rübe-Pugliese
We are supported by the TeX users groups. Please join a users group; see http://www.tug.org/usergroups.html .
Added support to break the objective function in as many lines as necessary. Inside the environment, the user can employ the command \breakObjective{} to add as many lines to the objective as desired.
The package’s Catalogue entry can be viewed at http://www.ctan.org/pkg/optidef The package’s files themselves can be inspected at http://mirror.ctan.org/macros/latex/contrib/optidef/
Thanks for the upload. For the CTAN Team Petra Rübe-Pugliese
We are supported by the TeX users groups. Please join a users group; see http://www.tug.org/usergroups.html .
optidef – Environments for writing optimization problems
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.
| Package | optidef |
| Version | 3.1 2019-04-23 |
| Copyright | 2016–2018 Jesus Lago Garcia |
| Maintainer | Jesus Lago Garcia |