Duality Theory in Inexact Multiobjective Programming

DOI10.1080/02522667.1988.10698920zbMath0655.90076OpenAlexW2008504058MaRDI QIDQ3802902

Vinod Lyall

Publication date: 1988

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

dualityproperly efficient solutionsvector minimizationinexact multiobjective linear programming problem

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Duality theory (optimization) (49N15)

Cites Work

• Inexact linear programming with generalized resource sets
• Proper efficiency and the theory of vector maximization
• Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Duality Theory in Inexact Multiobjective Programming