Interior penalty functions and duality in linear programming
    
    
  
  
  
      
      
      
        
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 18 (2012) no. 3, pp. 83-89
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			Logarithmic additive terms of barrier type with a penalty parameter are included into the Lagrange function of a linear programming problem. As a result, the problem of searching for saddle points of the modified Lagrangian becomes unconstrained (the saddle point is sought with respect to the whole space of primal and dual variables). Theorems on the asymptotic convergence to the desired solution and analogs of the duality theorems for the arising optimization minimax and maximin problem statements are formulated.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
linear programming, uality, inner penalty functions.
                    
                  
                
                
                @article{TIMM_2012_18_3_a9,
     author = {I. I. Eremin and L. D. Popov},
     title = {Interior penalty functions and duality in linear programming},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {83--89},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2012_18_3_a9/}
}
                      
                      
                    I. I. Eremin; L. D. Popov. Interior penalty functions and duality in linear programming. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 18 (2012) no. 3, pp. 83-89. http://geodesic.mathdoc.fr/item/TIMM_2012_18_3_a9/
