An extreme-point-ranking algorithm for the extreme-point mathematical programming problem

DOI10.1016/0305-0548(86)90034-1zbMATH Open0625.90052OpenAlexW1975463324MaRDI QIDQ580171FDOQ580171

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

Recommendations

• On Extreme Point Programming Problem
• A branch and bound algorithm for extreme point mathematical programming problems
• A finite procedure to generate feasible points for the extreme point mathematical programming problem
• A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
• scientific article

zbMATH Keywords

computational experienceextreme-point mathematical programmingextreme-point ranking

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Cites Work

• Title not available (Why is that?)
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Finding all vertices of a convex polyhedron
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• Title not available (Why is that?)
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Optimization with disjunctive constraints
• Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
• A branch and bound algorithm for extreme point mathematical programming problems
• A classroom/time assignment model
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extreme Point Mathematical Programming
• Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
• Concave Programming Applied to a Special Class of 0-1 Integer Programs

Cited In (13)

• Title not available (Why is that?)
• A primal like algorithm for extreme point fuzzy mathematical programming problem
• On Extreme Point Programming Problem
• A finite procedure to generate feasible points for the extreme point mathematical programming problem
• Title not available (Why is that?)
• A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
• A branch and bound algorithm for extreme point mathematical programming problems
• Title not available (Why is that?)
• Degeneracy graphs: Theory and applications. An updated survey
• A versatile scheme for ranking the extreme points of an assignment polytope
• A finite algorithm for solving the generalized lattice point problem
• Selected bibliography on degeneracy
• Extreme point quadratic fractional programming problem

This page was built for publication: An extreme-point-ranking algorithm for the extreme-point mathematical programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580171)