Feasibility and infeasibility in optimization. Algorithms and computational methods.
From MaRDI portal
Publication:2473296
zbMath1178.90369MaRDI QIDQ2473296
Publication date: 27 February 2008
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
Related Items
Unit-operation nonlinear modeling for planning and scheduling applications ⋮ The maximum feasible subset problem (maxFS) and applications ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models ⋮ Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Improved constraint consensus methods for seeking feasibility in nonlinear programs ⋮ Achieving MILP feasibility quickly using general disjunctions ⋮ An interactive approach for bi-attribute multi-item auctions ⋮ A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality ⋮ Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system ⋮ Can linear superiorization be useful for linear optimization problems? ⋮ Human-centred feasibility restoration in practice ⋮ An algorithm for binary linear chance-constrained problems using IIS ⋮ Interactive approaches for biobjective problems with progressively changing solution sets ⋮ Irreducible infeasible subsystems of semidefinite systems ⋮ Convergence and perturbation resilience of dynamic string-averaging projection methods ⋮ Block-sparse recovery of semidefinite systems and generalized null space conditions ⋮ Snapping Graph Drawings to the Grid Optimally ⋮ Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs ⋮ Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ A multi-objective production smoothing model with compressible operating times ⋮ Feasibility in reverse convex mixed-integer programming ⋮ Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models ⋮ Preferential reducts and constructs in robust multiple criteria ranking and sorting ⋮ Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Identifying relatively irreducible infeasible subsystems of linear inequalities ⋮ A linear optimization-based method for data privacy in statistical tabular data ⋮ On linear infeasibility arising in intensity-modulated radiation therapy inverse planning ⋮ Automatic repair of convex optimization problems ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes ⋮ A heuristic block coordinate descent approach for controlled tabular adjustment ⋮ String-averaging projected subgradient methods for constrained minimization ⋮ Minimal infeasible constraint sets in convex integer programs ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ MCS Extraction with Sublinear Oracle Queries ⋮ Proximal operator of quotient functions with application to a feasibility problem in query optimization ⋮ The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
Uses Software
This page was built for publication: Feasibility and infeasibility in optimization. Algorithms and computational methods.
