scientific article; zbMATH DE number 1099078

MaRDI QIDQ4369264zbMATH OpenFDO

Authors Sharon Filipowski

Publication date 18 December 1997

zbMATH Keywords

approximate dataill-posed problemsymmetric linear programs

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
• A note on approximate linear programming
• The problem of linear programming with approximate data
• scientific article; zbMATH DE number 3876491
• On the complexity of solving feasible systems of linear inequalities specified with approximate data
• On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
• scientific article; zbMATH DE number 16591
• How partial knowledge helps to solve linear programs
• scientific article; zbMATH DE number 1488907
• scientific article; zbMATH DE number 3511865

Cited in

(6)

• On the complexity of solving feasible systems of linear inequalities specified with approximate data
• How partial knowledge helps to solve linear programs
• Solving linear programming with constraints unknown
• On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
• On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
• Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs

This page was built for publication:

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