Polyhedral extensions of some theorems of linear programming

DOI10.1007/BF01585102MaRDI QIDQ3959739zbMATH OpenFDO

Authors L. McLinden

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01585102

zbMATH Keywords

complementary unboundednessexistence of optimal solutionsgeneral polyhedral convexitymonotone complementarity problemTucker's theoremWilliams' theorems

Mathematics Subject Classification ID

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

Cites work

• A general correspondence between dual minimax problems and convex programs
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• Boundedness relations for linear constraint sets
• Complementarity Theorems for Linear Programming
• Convex Analysis
• Duality in Homogeneous Programming
• scientific article; zbMATH DE number 3121281 (Why is no real title available?)
• scientific article; zbMATH DE number 3121284 (Why is no real title available?)
• scientific article; zbMATH DE number 3788387 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• Rudin Varieties in Products of Two Annuli
• Symmetric Duality for Structured Convex Programs

Cited in

(5)

• Weighting factor results in vector optimization
• Limiting behavior of weighted central paths in linear programming
• On polyhedral extension of some LP theorems
• Facial reduction and partial polyhedrality
• On Pareto optima, the Fermat-Weber problem, and polyhedral gauges

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959739)