Analyzing infeasible nonlinear programs
From MaRDI portal
Recommendations
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Approaches to Diagnosing Infeasible Linear Programs
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- Computer Codes for the Analysis of Infeasible Linear Programs
- scientific article; zbMATH DE number 1260459
- scientific article; zbMATH DE number 1206370
- scientific article; zbMATH DE number 1163812
- Nonlinear programming
- scientific article; zbMATH DE number 3308846
Cites work
- scientific article; zbMATH DE number 95068 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- Identifying Minimally Infeasible Subsystems of Inequalities
- Irreducibly inconsistent systems of linear inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- MINOS(IIS): Infeasibility analysis using MINOS
- Solving Large Sparse Nonlinear Programs Using GRG
Cited in
(9)- Feasibility in reverse convex mixed-integer programming
- Generalized filtering algorithms for infeasibility analysis
- Infeasibility analysis for systems of quadratic convex inequalities
- On infeasibility of systems of convex analytic inequalities
- Computer Codes for the Analysis of Infeasible Linear Programs
- Irreducible infeasible sets in convex mixed-integer programs
- Feasible partition problem in reverse convex and convex mixed-integer programming
- Harvey Greenberg: analyzing infeasible mathematical programs
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
This page was built for publication: Analyzing infeasible nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804579)