Analyzing infeasible nonlinear programs

DOI10.1007/BF01302895zbMath0822.90123MaRDI QIDQ1804579

John W. Chinneck

Publication date: 11 June 1995

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

infeasibilitydeletion filtering algorithmformulation assistancenonlinear optimizers

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (7)

Feasibility in reverse convex mixed-integer programming ⋮ Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models ⋮ Generalized filtering algorithms for infeasibility analysis ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ On infeasibility of systems of convex analytic inequalities ⋮ Infeasibility analysis for systems of quadratic convex inequalities

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Irreducibly inconsistent systems of linear inequalities
• MINOS(IIS): Infeasibility analysis using MINOS
• Solving Large Sparse Nonlinear Programs Using GRG
• Identifying Minimally Infeasible Subsystems of Inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs

This page was built for publication: Analyzing infeasible nonlinear programs