New descent rules for solving the linear semi-infinite programming problem
type: Item
instance of: scholarly article
title: New descent rules for solving the linear semi-infinite programming problem
zbMATH Open document ID: 0810.90123
DOI: 10.1016/0167-6377(94)90006-X
author: E. Vercher
author: Teresa León
published in: Operations Research Letters
publication date: 1994-09-05T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 633817
zbMATH Keywords: continuous semi-infinite linear programming
describes a project that uses: XMP
MaRDI profile type: Publication
cites work: Q3716809
cites work: An extension of the simplex algorithm for semi-infinite linear programming
cites work: Q3694971
cites work: A projected lagrangian algorithm for semi-infinite programming
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: A purification algorithm for semi-infinite programming
cites work: An optimality test for semi-infinite linear programming
cites work: Q5589748
cites work: Q3701215
cites work: Q3873909
cites work: A comparative study of several semi-infinite nonlinear programming algorithms
full work available at URL: 0167-6377(94)90006-x
OpenAlex ID: W2143082120
description: scientific article; zbMATH DE number 633817