Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems

DOI10.1007/BF01956854MaRDI QIDQ5675137zbMATH OpenOpenAlexFDO

Authors Kanti Swarup, Munish C. Puri

Publication date 1973

Published in Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01956854

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites work

• Extreme Point Mathematical Programming
• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 3405689 (Why is no real title available?)
• Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems

Cited in

(5)

• 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 finite algorithm for solving the generalized lattice point problem
• Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem

This page was built for publication: Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems

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