Eliminating Duality Gap by α Penalty
نویسنده
چکیده
In this short and self contained paper we are proposing a simple penalty, which is a modification on the constraint set. We show that duality gap is eliminated under certain conditions.
منابع مشابه
Exact augmented Lagrangian duality for mixed integer linear programming
We investigate the augmented Lagrangian dual (ALD) for mixed integer linear programming (MIP) problems. ALD modifies the classical Lagrangian dual by appending a nonlinear penalty function on the violation of the dualized constraints in order to reduce the duality gap. We first provide a primal characterization for ALD for MIPs and prove that ALD is able to asymptotically achieve zero duality g...
متن کاملA penalty function approach for solving bi-level linear programs
The paper presents an approach to bi-level programming using a duality gap-penalty function format. A new exact penalty function exists for obtaining a global optimal solution for the linear case, and an algorithm is given for doing this, making use of some new theoretical properties. For each penalty parameter value, the central optimisation problem is one of maximising a convex function over ...
متن کاملLagrangian Relaxation Technique for Solving Scheduling Problems by Decomposition of Timed Petri Nets
In this paper, we propose Lagrangian relaxation technique for solving scheduling problems by decomposition of timed Petri nets. The scheduling problem is represented by the transition firing sequence problem to minimize a given objective function. The timed Petri net is decomposed into several subnets so that the subproblem for each subnet can be easily solved by a shortest path algorithm. The ...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملDecreasing Functions with Applications
The theory of increasing positively homogeneous functions deened on the positive orthant is applied to the class of decreasing functions. A multiplicative version of the inf-convolution operation is studied for decreasing functions. Modiied penalty functions for some constrained optimization problems are introduced which are in general nonlinear with respect to the objective function of the ori...
متن کامل