Some generalization of inexact linear programming

DOI10.1080/02331939208843740zbMATH Open0817.90065OpenAlexW1973553606MaRDI QIDQ4327872FDOQ4327872

Authors: Marian Matłoka 

Publication date: 27 March 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843740

zbMATH Keywords

inexact programmingfeasible and optimal solution

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—Constraint Qualifications for Inexact Linear Programs
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Erratum

Cited In (11)

• Title not available (Why is that?)
• Modelos auxiliares para problemas de programacion lineal con coeficientes imprecisos en las restricciones
• Duality for inexact semi-infinite linear programming
• Some perturbation theory for linear programming
• Connections between generalized, inexact and semi-infinite linear programming
• Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
• Duality for inexact linear programming problems^∗
• Helly-type theorems and generalized linear programming
• Inexact linear programming with generalized technological matrix sets
• Strong duality for inexact linear programming
• Cutting plane algorithms for robust conic convex optimization problems

This page was built for publication: Some generalization of inexact linear programming

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