Analysis of mathematical programming problems prior to applying the simplex algorithm
From MaRDI portal
Publication:4079319
DOI10.1007/BF01580428zbMath0317.90037MaRDI QIDQ4079319
Gautam Mitra, H. Paul Williams, A. L. Brearley
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
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, 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, Constraint propagation, relational arithmetic in AI systems and mathematical programs, Constructing integer programming models by the predicate calculus, 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, 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, Robust preliminary analysis of large-scale linear model for optimal industrial investments, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, 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, 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
Cites Work
