Lagrangean duality for facial programs with applications to integer and complementarity problems

DOI10.1016/0167-6377(92)90006-OzbMath0773.90070OpenAlexW1980898571MaRDI QIDQ1196216

Christian Larsen, Jørgen Tind

Publication date: 17 December 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90006-o

zbMATH Keywords

duality gapcomplementarity constraintsfacial constraintfacial disjunctive programmingLagrangean duality

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

On some connections among variational inequalities, combinatorial and continuous optimization ⋮ Connections among constrained continuous and combinatorial vector optimization ⋮ Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• Optimization with disjunctive constraints
• Some generalizations of positive definiteness and monotonicity
• Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
• Penalty for zero–one integer equivalent problem
• An elementary survey of general duality theory in mathematical programming
• Disjunctive Programming
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints

This page was built for publication: Lagrangean duality for facial programs with applications to integer and complementarity problems