Technical Note—Constraint Qualifications for Inexact Linear Programs

DOI10.1287/OPRE.27.4.843zbMATH Open0412.90045OpenAlexW2141571004MaRDI QIDQ4199831FDOQ4199831

Authors: Jean-Charles Pomerol 

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1287/opre.27.4.843

zbMATH Keywords

constraint qualificationsduality theoreminexact linear programs

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (12)

• Sufficient optimality conditions and duality theory for interval optimization problem
• Duality theory in interval-valued linear programming problems
• Analysis of structure in fuzzy linear programs
• Wolfe duality for interval-valued optimization
• Duality theory for optimization problems with interval-valued objective functions
• Duality for inexact linear programming problems^∗
• Optimality conditions and duality results for non-differentiable interval optimization problems
• Some generalization of inexact linear programming
• The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
• On interval-valued nonlinear programming problems
• Inexact linear programming with generalized resource sets
• Strong duality for inexact linear programming

This page was built for publication: Technical Note—Constraint Qualifications for Inexact Linear Programs

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