Technical Note—A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures

DOI10.1287/OPRE.28.2.424zbMath0426.90058OpenAlexW1990000654MaRDI QIDQ3863691

Gary J. Koehler, Surya Bhushan Kumar

Publication date: 1980

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.28.2.424

zbMATH Keywords

relaxationsubgradient optimizationfinding points of a convex polyhedron

Mathematics Subject Classification ID

Linear programming (90C05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

This page was built for publication: Technical Note—A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures