CTAN update: optidef
Date: May 24, 2018 6:16:06 PM CEST
Jesus Lago Garcia submitted an update to the
optidef
package.
Version number: 2.7
License type: lppl1.3
Summary description: Environments for writing optimization problems
Announcement text:
The new version 2.7 has two new features: - Selection of the default configuration of the constraint alignment. - A new environment minie that can be used instead of the the mini! environment to avoid clashes with some languages of the babel library.
This package is located at http://mirror.ctan.org/macros/latex/contrib/optidef More information is at https://www.ctan.org/pkg/optidef
Thanks for the upload. For the CTAN Team Manfred Lotz We are supported by the TeX user groups. Please join a users group; see http://www.tug.org/usergroups.html .
The new version 2.7 has two new features: - Selection of the default configuration of the constraint alignment. - A new environment minie that can be used instead of the the mini! environment to avoid clashes with some languages of the babel library.
This package is located at http://mirror.ctan.org/macros/latex/contrib/optidef More information is at https://www.ctan.org/pkg/optidef
Thanks for the upload. For the CTAN Team Manfred Lotz We are supported by the TeX user 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 |