作者: Siegfried Helbig
DOI: 10.1007/BF01581688
关键词: Mathematics 、 Discrete mathematics 、 Linear programming 、 Weak duality 、 Fractional programming 、 Vector optimization 、 Strong duality 、 Duality gap 、 Duality (optimization) 、 Perturbation function
摘要: In this paper, we develop a new duality theory for families of linear programs with an emphasis on disjunctive optimization by proposing `vector' problem as dual problem. We establish that the well-known relations between primal and problems hold in context. show our method generalizes results Borwein programs, Balas Patkar Stancu-Minasian fractional programs. Moreover, can derive some integer where denominator is not assumed (as usual) to be greater than zero each feasible point.