# New on CTAN: optidef

Date: June 7, 2016 3:13:42 PM CEST

J. Lago Garcia submitted the
optidef
package.
Version number: 2016-06-06
License type: lppl1.3
Summary description: Provides a standard set of environments for writing
minimization problems
Announcement text:

This small library provides a standard set of environments for writing minimization problems. The most important features are: - 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.

This package is located at http://mirror.ctan.org/macros/latex/contrib/optidef More information is at http://www.ctan.org/pkg/optidef We are supported by the TeX users groups. Please join a users group; see http://www.tug.org/usergroups.html .

Thanks for the upload. For the CTAN Team Erik Braun

This small library provides a standard set of environments for writing minimization problems. The most important features are: - 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.

This package is located at http://mirror.ctan.org/macros/latex/contrib/optidef More information is at http://www.ctan.org/pkg/optidef We are supported by the TeX users groups. Please join a users group; see http://www.tug.org/usergroups.html .

Thanks for the upload. For the CTAN Team Erik Braun

## 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 |