How to Install and Uninstall texlive-optidef Package on openSUSE Leap

Last updated: December 27,2024

1. Install "texlive-optidef" package

Please follow the steps below to install texlive-optidef on openSUSE Leap


    
        
            $
        

        
            
                sudo zypper refresh
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo zypper install
            
                        
                texlive-optidef
            
                    
    
    Copied

2. Uninstall "texlive-optidef" package

Please follow the guidelines below to uninstall texlive-optidef on openSUSE Leap:


    
        
            $
        

        
            
                sudo zypper remove
            
                        
                texlive-optidef
            
                    
    
    Copied

3. Information about the texlive-optidef package on openSUSE Leap

Information for package texlive-optidef:
----------------------------------------
Repository : Main Repository
Name : texlive-optidef
Version : 2021.189.3.1svn50941-150400.17.1
Arch : noarch
Vendor : SUSE LLC
Installed Size : 24.0 KiB
Installed : No
Status : not installed
Source package : texlive-specs-q-2021-150400.17.1.src
Upstream URL : http://www.tug.org/texlive/
Summary : 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: 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.