A branch and bound algorithm for extreme point mathematical programming problems
From MaRDI portal
Publication:1078072
DOI10.1016/0166-218X(85)90078-2zbMath0595.90063MaRDI QIDQ1078072
Hanif D. Sherali, Suvrajeet Sen
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
convex polytopebranch and boundhyperplanecomputational resultslinear inequalitiescontinuous relaxationpenaltiesextreme point mathematical programming
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05) Boolean programming (90C09)
Related Items (6)
A finite procedure to generate feasible points for the extreme point mathematical programming problem ⋮ A finite algorithm for solving the generalized lattice point problem ⋮ Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization ⋮ Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming ⋮ An extreme-point-ranking algorithm for the extreme-point mathematical programming problem ⋮ The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization with disjunctive constraints
- A classroom/time assignment model
- An Automatic Method of Solving Discrete Programming Problems
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Computer Codes for Problems of Integer Programming
- 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
- Convergent Algorithms for Minimizing a Concave Function
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- 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
- Expected Number of Vertices of a Random Convex Polyhedron
- The Generalized Lattice-Point Problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Integer Programming by Implicit Enumeration and Balas’ Method
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- Extreme Point Mathematical Programming
- Generating All the Faces of a Polyhedron
- 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
This page was built for publication: A branch and bound algorithm for extreme point mathematical programming problems
