Automatic repair of convex optimization problems
- 23 May 2020
- journal article
- research article
- Published by Springer Nature in Optimization and Engineering
- Vol. 22 (1) , 247-259
Abstract
No abstract availableKeywords
All Related Versions
This publication has 28 references indexed in Scilit:
- A reformulation–linearization–convexification algorithm for optimal correction of an inconsistent system of linear constraintsComputers & Operations Research, 2008
- Branch-and-Cut for the Maximum Feasible Subsystem ProblemSIAM Journal on Optimization, 2008
- Infeasibility analysis for systems of quadratic convex inequalitiesEuropean Journal of Operational Research, 1998
- Detecting iis in infeasible linear programmes using techniques from goal programmingComputers & Operations Research, 1996
- A note on resolving infeasibility in linear programs by constraint relaxationOperations Research Letters, 1993
- Analyze: A computer-assisted analysis system for linear programming modelsOperations Research Letters, 1987
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs1987
- Irreducibly inconsistent systems of linear inequalitiesEuropean Journal of Operational Research, 1981
- PERUSE: An Interactive System for Mathematical ProgramsACM Transactions on Mathematical Software, 1980
- Systems of Linear InequalitiesAnnals of Mathematics, 1922