How to Install and Uninstall coin-or-Ipopt.i686 Package on Fedora 34

Last updated: July 05,2024

1. Install "coin-or-Ipopt.i686" package

Please follow the step by step instructions below to install coin-or-Ipopt.i686 on Fedora 34


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                coin-or-Ipopt.i686
            
                    
    
    Copied

2. Uninstall "coin-or-Ipopt.i686" package

This is a short guide on how to uninstall coin-or-Ipopt.i686 on Fedora 34:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                coin-or-Ipopt.i686
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the coin-or-Ipopt.i686 package on Fedora 34

Last metadata expiration check: 1:45:25 ago on Tue Sep 6 14:10:38 2022.
Available Packages
Name : coin-or-Ipopt
Version : 3.13.0
Release : 11.fc34
Architecture : i686
Size : 784 k
Source : coin-or-Ipopt-3.13.0-11.fc34.src.rpm
Repository : fedora
Summary : Interior Point OPTimizer
URL : https://coin-or.github.io/Ipopt/
License : EPL-1.0
Description : Ipopt (Interior Point OPTimizer, pronounced eye-pea-Opt) is a software
: package for large-scale nonlinear optimization. It is designed to find
: (local) solutions of mathematical optimization problems of the form
:
: min f(x)
: x in R^n
:
: s.t. g_L <= g(x) <= g_U
: x_L <= x <= x_U
:
: where f(x): R^n --> R is the objective function, and g(x): R^n --> R^m are
: the constraint functions. The vectors g_L and g_U denote the lower and upper
: bounds on the constraints, and the vectors x_L and x_U are the bounds on
: the variables x. The functions f(x) and g(x) can be non-linear and non-convex,
: but should be twice continuously differentiable. Note that equality
: constraints can be formulated in the above formulation by setting the
: corresponding components of g_L and g_U to the same value.