Strong duality for a special class of integer programs
| Autor: | J. M. Fleisher, R. R. Meyer |
|---|---|
| Rok vydání: | 1977 |
| Předmět: |
Discrete mathematics
Control and Optimization Duality gap Applied Mathematics MathematicsofComputing_NUMERICALANALYSIS Duality (optimization) Management Science and Operations Research Weak duality TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Prime factor Greatest common divisor Strong duality Radical of an integer Integer programming Mathematics |
| Zdroj: | Journal of Optimization Theory and Applications. 22:25-30 |
| ISSN: | 1573-2878 0022-3239 |
| Popis: | A pair of primal-dual integer programs is constructed for a class of problems motivated by a generalization of the concept of greatest common divisor. The primal-dual formulation is based on a number-theoretic, rather than a Lagrangian, duality property; consequently, it avoids the dualitygap common to Lagrangian duals in integer programming. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink