Analysis of mathematical programming problems prior to applying the simplex algorithm

Cites work

An Additive Algorithm for Solving Linear Programs with Zero-One Variables
scientific article; zbMATH DE number 3521444 (Why is no real title available?)
scientific article; zbMATH DE number 3520148 (Why is no real title available?)
scientific article; zbMATH DE number 3550467 (Why is no real title available?)
scientific article; zbMATH DE number 3438384 (Why is no real title available?)

Cited in

(77)

A possible way to reduce degeneracy in integer programming computations
A constraint selection technique for a class of linear programs
\(O(n \log n)\) procedures for tightening cover inequalities
A computational study of redundancy in randomly generated polytopes
A hierarchical algorithm for making sparse matrices sparser
Detecting embedded pure network structures in LP problems
A linear and discrete programming framework for representing qualitative knowledge
Balance constraints reduction of large-scale linear programming problems
Well management in the North Sea
Solving integer programs with a few important binary gub constraints
Tools for reformulating logical forms into zero-one mixed integer programs
MOPS -- Mathematical optimization system
Reducing the number of variables in integer and linear programming problems
Dynamic factorization in large-scale optimization
Supernode processing of mixed-integer models
A note on a maximum distance problem
Interactions between nonlinear programming and modeling systems
Some properties of cliques in 0-1 mixed integer programs
Redundancy elimination with a lexicographic solved form
Extracting pure network submatrices in linear programs using signed graphs.
Combinatorial optimization: current successes and directions for the future
Advances in design and implementation of optimization software
Domain reduction techniques for global NLP and MINLP optimization
Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
Analysis of structure in fuzzy linear programs
On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
A constraint selection technique in limit analysis
A pathological case in the reduction of linear programs
A statistical generalized programming algorithm for stochastic optimization problems
Presolving in linear programming
Tighter McCormick relaxations through subgradient propagation
Experiments with conflict analysis in mixed integer programming
Preprocessing and cutting planes with conflict graphs
Computational aspects of infeasibility analysis in mixed integer programming
Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
Robust preliminary analysis of large-scale linear model for optimal industrial investments
Ten years of feasibility pump, and counting
Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems
Hit-and-run algorithms for the identification of nonredundant linear inequalities
Automatic identification of embedded network rows in large-scale optimization models
Formal optimization of some reduced linear programming problems
Presolve Reductions in Mixed Integer Programming
A heuristic approach for identification of redundant constraints in linear programming models
Solving large-scale mixed-integer programs with fixed charge variables
Extracting embedded generalized networks from linear programming problems
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
A heuristic algorithm for resource allocation/reallocation problem
Stronger formulations of mixed integer linear programs: an example
On free variables in interior point methods
The BPMPD interior point solver for convex quadratic problems
Discovering the Characteristics of Mathematical Programs via Sampling
Conflict-Driven Heuristics for Mixed Integer Programming
Screening rules and its complexity for active set identification
Explicit model predictive control: a connected-graph approach
A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
Deletion presolve for accelerating infeasibility diagnosis in optimization models
Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
Shift-and-propagate
Mixed integer programming: A historical perspective with Xpress-MP
Broadening the integer programming audience, the LINDO perspective
A comparative study of redundant constraints identification methods in linear programming problems
IntSat: integer linear programming by conflict-driven constraint learning
Solving continuous and discrete nonlinear programs with BARON
A combined linear and nonlinear presolve for nonlinear optimization
Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
A novel linear optimization presolve technique based on Fourier-Motzkin elimination
Branch and bound with estimation based on pseudo-shadow-prices
Computational experience with a primal-dual interior point method for linear programming
Optimizing over three-dimensional subspaces in an interior-point method for linear programming
Coefficient strengthening: a tool for reformulating mixed-integer programs
A computational intelligence method for solving a class of portfolio optimization problems
Progress in presolving for mixed integer programming
Constraint propagation, relational arithmetic in AI systems and mathematical programs
Constructing integer programming models by the predicate calculus
Efficient preprocessing for VLSI optimization problems

This page was built for publication: Analysis of mathematical programming problems prior to applying the simplex algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079319)