Duality Theory in Inexact Multiobjective Programming

DOI10.1080/02522667.1988.10698920MaRDI QIDQ3802902zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Proper Efficiency and Multiobjective Duality in Nonlinear Programming
• scientific article; zbMATH DE number 572159
• scientific article; zbMATH DE number 3970516
• scientific article; zbMATH DE number 3858876
• A converse duality theorem in multiple objective programming

Cites work

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

Cited in

(3)

• Duality theory and slackness conditions in multiobjective linear programming
• scientific article; zbMATH DE number 3970516 (Why is no real title available?)
• scientific article; zbMATH DE number 3965835 (Why is no real title available?)

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

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