Robust optimality analysis for linear programming problems with uncertain objective function coefficients: an outer approximation approach

DOI10.14736/KYB-2023-1-0064MaRDI QIDQ5887309zbMATH OpenOpenAlexFDO

Authors Zhenzhong Gao, Masahiro Inuiguchi

Publication date 18 April 2023

Published in Kybernetika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14736/kyb-2023-1-0064

zbMATH Keywords

convex polytopeinteractive uncertain coefficientslinear programming problemsouter approximation approachrobust optimality analysis

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Recommendations

• Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients
• Linear programming with uncertain data: some extensions to robust optimization
• Robust solutions of uncertain linear programs
• Optimality Analysis for Stochastic LP Problems
• Robust sensitivity analysis of the optimal value of linear programming

This page was built for publication: Robust optimality analysis for linear programming problems with uncertain objective function coefficients: an outer approximation approach

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