scientific article
From MaRDI portal
Publication:3748063
zbMATH Open0608.90064MaRDI QIDQ3748063
Publication date: 1986
Title of this publication is not available (Why is that?)
linear semi-infinite programmingconvergence theoremSlater's conditionfeasible setsupporting hyperplanesupporting cutting plane
Numerical mathematical programming methods (65K05) Linear programming (90C05) Semi-infinite programming (90C34)
Related Items (2)
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ A unifying framework for several cutting plane methods for semidefinite programming
Recommendations
- Title not available (Why is that?) 👍 👎
- Cutting plane algorithms for the inverse mixed integer linear programming problem 👍 👎
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications 👍 👎
- An accelerated central cutting plane algorithm for linear semi-infinite programming 👍 👎
- Relaxed cutting plane method for solving linear semi-infinite programming problems 👍 👎
- A relaxed cutting plane method for semi-infinite semi-definite programming 👍 👎
- A cutting plane algorithm for solving linear bilevel programs 👍 👎
- A cutting-plane method for quadratic semi infinite programming problems 👍 👎
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems 👍 👎
- A cutting plane algorithm for linear reverse convex programs 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748063)
