Symmetric duality for disjunctive programming with absolute value functionals
From MaRDI portal
A duality theory for disjunctive linear programming problems of special kind is suggested. There is no duality gap between the solutions of the pair of dual problems constructed. This idea is extended to zero-one and integer problems.
Recommendations
- Duality in disjunctive linear fractional programming
- Duality for nonconvex absolute value programming and a characterization of linear max-min programs
- scientific article; zbMATH DE number 3922373
- Duality in disjunctive programming via vector optimization
- scientific article; zbMATH DE number 1482995
Cites work
- A Convergent Duality Theory for Integer Programming
- Constructive Group Relaxations for Integer Programs
- scientific article; zbMATH DE number 3353073 (Why is no real title available?)
- Improved integer programming bounds using intersections of corner polyhedra
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Partitioning procedures for solving mixed-variables programming problems
Cited in
(6)- Duality for nonconvex absolute value programming and a characterization of linear max-min programs
- Duality in disjunctive programming via vector optimization
- On the optimality of nonlinear fractional disjunctive programming problems
- scientific article; zbMATH DE number 1482995 (Why is no real title available?)
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs
- A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
This page was built for publication: Symmetric duality for disjunctive programming with absolute value functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078070)
