Finding saddle points on convex polyhedra in minimax optimization problems with linear constraints

zbMath0453.90073MaRDI QIDQ1149382

A. S. Belen'kij

Publication date: 1980

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

maximinminimax optimizationlinear constraintslinear inequalitiesconvex polyhedraconvex-concave functiondetermination of saddle pointspolyhedral game

Mathematics Subject Classification ID

Convex programming (90C25) Polytopes and polyhedra (52Bxx)

Related Items

Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables