The polyhedral Lagrange principle

DOI10.1134/S0037446611030104zbMath1227.15017MaRDI QIDQ642053

Semen S. Kutateladze

Publication date: 25 October 2011

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

zbMATH Keywords

linear programmingFarkas lemmaBoolean valued analysisDedekind complete vector latticeinterval equationspolyhedral sublinear inequalities

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Interval and finite arithmetic (65G30)

Related Items (3)

Math-Selfie ⋮ Leibnizian, Robinsonian, and Boolean valued monads ⋮ Nonstandard tools of nonsmooth analysis

Cites Work

• The Farkas Lemma revisited
• Linear Optimization Problems with Inexact Data
• Unnamed Item

This page was built for publication: The polyhedral Lagrange principle