Analysis of mathematical programming problems prior to applying the simplex algorithm
From MaRDI portal
Publication:4079319
DOI10.1007/BF01580428zbMath0317.90037MaRDI QIDQ4079319
Gautam Mitra, A. L. Brearley, H. Paul Williams
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
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, Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems, Discovering the Characteristics of Mathematical Programs via Sampling, Coefficient strengthening: a tool for reformulating mixed-integer programs, A possible way to reduce degeneracy in integer programming computations, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, A constraint selection technique for a class of linear programs, A statistical generalized programming algorithm for stochastic optimization problems, Interactions between nonlinear programming and modeling systems, Some properties of cliques in 0-1 mixed integer programs, Presolving in linear programming, Redundancy elimination with a lexicographic solved form, \(O(n \log n)\) procedures for tightening cover inequalities, A polynomial arc-search interior-point algorithm for linear programming, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems, A computational intelligence method for solving a class of portfolio optimization problems, A heuristic algorithm for resource allocation/reallocation problem, A comparative study of redundant constraints identification methods in linear programming problems, Screening Rules and its Complexity for Active Set Identification, Progress in presolving for mixed integer programming, Domain reduction techniques for global NLP and MINLP optimization, Constraint propagation, relational arithmetic in AI systems and mathematical programs, Constructing integer programming models by the predicate calculus, Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, Extracting pure network submatrices in linear programs using signed graphs., Explicit model predictive control: a connected-graph approach, Stronger formulations of mixed integer linear programs: an example, Automatic identification of embedded network rows in large-scale optimization models, Formal optimization of some reduced linear programming problems, Shift-and-propagate, Hit-and-run algorithms for the identification of nonredundant linear inequalities, On free variables in interior point methods, A computational study of redundancy in randomly generated polytopes, A hierarchical algorithm for making sparse matrices sparser, Mixed integer programming: A historical perspective with Xpress-MP, Broadening the integer programming audience, the LINDO perspective, Efficient preprocessing for VLSI optimization problems, Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints, Tighter McCormick relaxations through subgradient propagation, Experiments with conflict analysis in mixed integer programming, Robust preliminary analysis of large-scale linear model for optimal industrial investments, Preprocessing and cutting planes with conflict graphs, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems, Detecting embedded pure network structures in LP problems, Presolve Reductions in Mixed Integer Programming, Analysis of structure in fuzzy linear programs, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, Computational aspects of infeasibility analysis in mixed integer programming, A constraint selection technique in limit analysis, Conflict-Driven Heuristics for Mixed Integer Programming, A pathological case in the reduction of linear programs, Ten years of feasibility pump, and counting, Combinatorial optimization: current successes and directions for the future, 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, Solving large-scale mixed-integer programs with fixed charge variables, A heuristic approach for identification of redundant constraints in linear programming models, The BPMPD interior point solver for convex quadratic problems, Advances in design and implementation of optimization software, 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, Tools for reformulating logical forms into zero-one mixed integer programs, MOPS -- Mathematical optimization system, Extracting embedded generalized networks from linear programming problems
Cites Work
