Pages that link to "Item:Q4079319"

The following pages link to Analysis of mathematical programming problems prior to applying the simplex algorithm (Q4079319):

Displaying 23 items.

• Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
• Robust preliminary analysis of large-scale linear model for optimal industrial investments (Q2271503) (← links)
• Ten years of feasibility pump, and counting (Q2329705) (← links)
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
• Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
• Automatic identification of embedded network rows in large-scale optimization models (Q3315283) (← links)
• Formal optimization of some reduced linear programming problems (Q3320119) (← links)
• Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
• A heuristic approach for identification of redundant constraints in linear programming models (Q3437363) (← links)
• Solving large-scale mixed-integer programs with fixed charge variables (Q3680611) (← links)
• Extracting embedded generalized networks from linear programming problems (Q3693261) (← links)
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
• Stronger formulations of mixed integer linear programs: an example (Q4378103) (← links)
• On free variables in interior point methods (Q4391291) (← links)
• The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
• Discovering the Characteristics of Mathematical Programs via Sampling (Q4806377) (← links)
• Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
• Screening Rules and its Complexity for Active Set Identification (Q5026418) (← links)
• A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems (Q5101409) (← links)
• Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
• Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)