A Group Theoretic Dual Problem without Duality Gaps for Bounded Integer Programs
نویسنده
چکیده
We present a procedure for constructing a group theoretic dual problem with no duality gap to a given bounded integer programming problem. An optimal solution of this dual problem is easily determined and an optimal solution of the integer programming problem can be obtained by solving only one group optimization problem.
منابع مشابه
Exponential membership function and duality gaps for I-fuzzy linear programming problems
Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...
متن کاملSecond-Order Symmetric Duality for Minimax Mixed Integer Programs over Cones
A duality theorem for a pair of Wolfe-type second-order minimax mixed integer symmetric dual programs over cones is proved under separability and η-bonvexity/η-boncavity of the function k(x, y) appearing in the objective, where : . n m k R R R × ֏ Mond-Weir type symmetric duality over cones is also studied under η-pseudobonvexity/ηpseudoboncavity assumptions. Self duality (when the dual proble...
متن کاملStrong Dual for Conic Mixed-Integer Programs∗
Mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [4], [11]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we ar...
متن کاملStable Zero Duality Gaps in Convex Programming: Complete Dual Characterisations with Applications to Semidefinite Programs∗
The zero duality gap that underpins the duality theory is one of the central ingredients in optimisation. In convex programming, it means that the optimal values of a given convex program and its associated dual program are equal. It allows, in particular, the development of efficient numerical schemes. However, the zero duality gap property does not always hold even for finite dimensional prob...
متن کاملComplete Solutions to Mixed Integer Programming
This paper considers a new canonical duality theory for solving mixed integer quadratic programming problem. It shows that this well-known NP-hard problem can be converted into concave maximization dual problems without duality gap. And the dual problems can be solved, under certain conditions, by polynomial algorithms.
متن کامل