Objective function bounds for the inexact linear programming problem with generalized cost coefficients

DOI10.1016/0305-0548(85)90020-6zbMath0606.90085OpenAlexW2065632361MaRDI QIDQ1085061

Sangit Chatterjee, Jonathan F. Bard

Publication date: 1985

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(85)90020-6

zbMATH Keywords

Simulationinexact linear programmingworst case and best case solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

A necessity measure of fuzzy inclusion relation in linear programming problems, Approaches to sensitivity analysis in linear programming, An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inexact linear programming with generalized technological matrix sets
• Inexact linear programming with generalized resource sets
• Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
• Technical Note—Exact Solutions of Inexact Linear Programs
• Expected Objective Value of a Stochastic Linear Program and the Degree of Uncertainty of Parameters
• Sensitivity analysis for nonlinear programming using penalty methods
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Proximate linear programming: A variable extreme point method
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming