Technical Note—Constraint Qualifications for Inexact Linear Programs

DOI10.1287/opre.27.4.843zbMath0412.90045OpenAlexW2141571004MaRDI QIDQ4199831

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

duality theoremconstraint qualificationsinexact linear programs

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (12)

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

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