Symmetric duality for disjunctive programming with absolute value functionals
From MaRDI portal
Publication:1078070
DOI10.1016/0377-2217(86)90194-3zbMath0595.90056OpenAlexW1981338248MaRDI QIDQ1078070
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90194-3
Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09) Duality theory (optimization) (49N15)
Related Items (3)
On optimality and duality theorems of nonlinear disjunctive fractional minmax programs ⋮ A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming ⋮ On the optimality of nonlinear fractional disjunctive programming problems
Cites Work
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Improved integer programming bounds using intersections of corner polyhedra
- Constructive Group Relaxations for Integer Programs
- A Convergent Duality Theory for Integer Programming
This page was built for publication: Symmetric duality for disjunctive programming with absolute value functionals