New descent rules for solving the linear semi-infinite programming problem (Q1332958): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the simplex algorithm for semi-infinite linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected lagrangian algorithm for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A purification algorithm for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimality test for semi-infinite linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of several semi-infinite nonlinear programming algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(94)90006-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143082120 / rank
 
Normal rank

Latest revision as of 11:44, 30 July 2024

scientific article
Language Label Description Also known as
English
New descent rules for solving the linear semi-infinite programming problem
scientific article

    Statements