A finite procedure to generate feasible points for the extreme point mathematical programming problem
From MaRDI portal
Publication:1103529
DOI10.1016/0377-2217(88)90033-1zbMath0645.90067OpenAlexW2043500850MaRDI QIDQ1103529
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90033-1
Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Linear programming (90C05) Polytopes and polyhedra (52Bxx)
Related Items
Quadratic programming problems and related linear complementarity problems ⋮ A finite cutting plane method for solving linear programs with an additional reverse convex constraint ⋮ A finite algorithm for solving the generalized lattice point problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
- A branch and bound algorithm for extreme point mathematical programming problems
- A fast approximation algorithm for the multicovering problem
- Optimization with disjunctive constraints
- A finitely convergent procedure for facial disjunctive programs
- Quasi-concave minimization subject to linear constraints
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- 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
- Maximization of A convex quadratic function under linear constraints
- Polyhedral convexity cuts and negative edge extensions
- The Generalized Lattice-Point Problem
- Extreme Point Mathematical Programming
- Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
- Convexity Cuts and Cut Search
