Feasibility and infeasibility in optimization. Algorithms and computational methods.
From MaRDI portal
Publication:2473296
zbMATH Open1178.90369MaRDI QIDQ2473296FDOQ2473296
Authors: John W. Chinneck 
Publication date: 27 February 2008
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Recommendations
- Feasibility and optimality in structural design
- scientific article; zbMATH DE number 1163815
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Handling infeasibility in a large-scale nonlinear optimization algorithm
- Detecting infeasibility in infeasible-interior-point methods for optimization
Cited In (52)
- A generalized projection-based scheme for solving convex constrained optimization problems
- A linear optimization-based method for data privacy in statistical tabular data
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Feasibility and optimality in structural design
- Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
- Proximal operator of quotient functions with application to a feasibility problem in query optimization
- A hybrid algorithm for solving linear inequalities in a least squares sense
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
- Snapping graph drawings to the grid optimally
- On linear infeasibility arising in intensity-modulated radiation therapy inverse planning
- Identifying relatively irreducible infeasible subsystems of linear inequalities
- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs
- The maximum feasible subset problem (maxFS) and applications
- Human-centred feasibility restoration in practice
- Title not available (Why is that?)
- Automatic repair of convex optimization problems
- Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models
- Feasibility in reverse convex mixed-integer programming
- K-best feasible clusters - ranking optimal solutions from an infeasible LP
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Unit-operation nonlinear modeling for planning and scheduling applications
- String-averaging projected subgradient methods for constrained minimization
- Preferential reducts and constructs in robust multiple criteria ranking and sorting
- Achieving MILP feasibility quickly using general disjunctions
- Multistart algorithms for seeking feasibility
- Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers
- Interactive approaches for biobjective problems with progressively changing solution sets
- An algorithm for binary linear chance-constrained problems using IIS
- Feasible distance in non-conic convex optimization problems
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- A heuristic block coordinate descent approach for controlled tabular adjustment
- Infeasibility resolution based on goal programming
- Certificates of infeasibility via nonsmooth optimization
- An interactive approach for bi-attribute multi-item auctions
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- A multi-objective production smoothing model with compressible operating times
- Consistency analysis for massively inconsistent datasets in bound-to-bound data collaboration
- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- Irreducible infeasible sets in convex mixed-integer programs
- Diagnosing infeasible optimization problems using large language models
- Specialized fast algorithms for IQC feasibility and optimization problems.
- Bounded perturbation resilience of projected scaled gradient methods
- Feasible partition problem in reverse convex and convex mixed-integer programming
- Minimal infeasible constraint sets in convex integer programs
- Domain reduction techniques for global NLP and MINLP optimization
- Can linear superiorization be useful for linear optimization problems?
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- MCS Extraction with Sublinear Oracle Queries
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Irreducible infeasible subsystems of semidefinite systems
Uses Software
This page was built for publication: Feasibility and infeasibility in optimization. Algorithms and computational methods.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473296)
