Inexact linear programming with generalized technological matrix sets

DOI10.1016/0377-2217(84)90318-7zbMath0531.90065OpenAlexW2026389746MaRDI QIDQ788633

Jonathan F. Bard

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90318-7

zbMATH Keywords

ellipsoidal matrix setinexact linear programmingmatrix set of coefficientspolyhedral matrix set

Mathematics Subject Classification ID

Linear programming (90C05) Production theory, theory of the firm (91B38) Multisectoral models in economics (91B66)

Related Items (4)

Objective function bounds for the inexact linear programming problem with generalized cost coefficients ⋮ A necessity measure of fuzzy inclusion relation in linear programming problems ⋮ On the robust shortest path problem. ⋮ An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems

Cites Work

• Infinitely constrained optimization problems
• Inexact linear programming with generalized resource sets
• Chance-Constrained Programming
• Linear Programming under Uncertainty
• New Methods in Mathematical Programming—Methods of Solution of Linear Programs Under Uncertainty
• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inexact linear programming with generalized technological matrix sets