How to Install and Uninstall texlive-optidef.noarch Package on Fedora 34

Last updated: November 14,2024

1. Install "texlive-optidef.noarch" package

In this section, we are going to explain the necessary steps to install texlive-optidef.noarch on Fedora 34


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                texlive-optidef.noarch
            
                    
    
    Copied

2. Uninstall "texlive-optidef.noarch" package

Please follow the steps below to uninstall texlive-optidef.noarch on Fedora 34:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                texlive-optidef.noarch
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the texlive-optidef.noarch package on Fedora 34

Last metadata expiration check: 0:11:32 ago on Tue Sep 6 08:10:37 2022.
Available Packages
Name : texlive-optidef
Epoch : 9
Version : svn50941
Release : 39.fc34
Architecture : noarch
Size : 23 k
Source : texlive-2020-39.fc34.src.rpm
Repository : updates
Summary : Provides a standard set of environments for writing minimization problems
URL : http://tug.org/texlive/
License : LPPL
Description : This small library provides a standard set of environments for
: writing minimization 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.