_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
texlive-optidef 2024.2
Channel: guix
Location: gnu/packages/tex.scm (gnu packages tex)
Home page: https://ctan.org/pkg/optidef
Licenses: LPPL 1.3+
Synopsis: Environments for writing optimization problems
Description:

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:

  1. where no equation is referenced/numbered;

  2. where the problem is referenced with a single number;

  3. where each equation has an individual reference.

Finally, it also allows a definition of any optimization problem without a limitless number of constraints.

Total results: 1