An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
From MaRDI portal
Publication:580171
DOI10.1016/0305-0548(86)90034-1zbMath0625.90052OpenAlexW1975463324MaRDI QIDQ580171
Hanif D. Sherali, S. Elizabeth Dickey
Publication date: 1986
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(86)90034-1
Numerical mathematical programming methods (65K05) Linear programming (90C05) Polytopes and polyhedra (52Bxx)
Related Items
A finite algorithm for solving the generalized lattice point problem, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey
Cites Work
- A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
- A branch and bound algorithm for extreme point mathematical programming problems
- Optimization with disjunctive constraints
- A classroom/time assignment model
- Finding all vertices of a convex polyhedron
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom
- Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- The Generalized Lattice-Point Problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Extreme Point Mathematical Programming
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- Concave Programming Applied to a Special Class of 0-1 Integer Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
