Polyhedral extensions of some theorems of linear programming

DOI10.1007/BF01585102zbMath0495.90056MaRDI QIDQ3959739

L. McLinden

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

existence of optimal solutionsTucker's theoremmonotone complementarity problemcomplementary unboundednessgeneral polyhedral convexityWilliams' theorems

Mathematics Subject Classification ID

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

Related Items (5)

Limiting behavior of weighted central paths in linear programming ⋮ Weighting factor results in vector optimization ⋮ Facial Reduction and Partial Polyhedrality ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ On polyhedral extension of some LP theorems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• A general correspondence between dual minimax problems and convex programs
• Boundedness relations for linear constraint sets
• Duality in Homogeneous Programming
• Rudin Varieties in Products of Two Annuli
• Symmetric Duality for Structured Convex Programs
• Convex Analysis
• Complementarity Theorems for Linear Programming

This page was built for publication: Polyhedral extensions of some theorems of linear programming