A forward convex-simplex method
type: Item
instance of: scholarly article
title: A forward convex-simplex method
zbMATH Open document ID: 0618.90077
DOI: 10.1016/0377-2217(87)90246-3
author: Jonathan D. Stanley
published in: European Journal of Operational Research
publication date: 1987-01-01T00:00:00Z
review text: Forward algorithms provide a managerially practical way to solve multiperiod problems by solving progressively longer finite horizon subproblems. Many procedures of this nature already exist for special structures. \textit{J. E. Aronson, T. E. Morton} and \textit{G. L. Thompson} [ibid. 15, 348-365 (1984; Zbl 0527.90041)] have developed a forward simplex method for general staircase-structured linear programs. In this paper this method is extended to the case in which the objective function is convex.
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4003922
zbMATH Keywords: inventory
zbMATH Keywords: planning
zbMATH Keywords: production
zbMATH Keywords: Forward algorithms
zbMATH Keywords: multiperiod problems
zbMATH Keywords: forward simplex method
zbMATH Keywords: staircase-structured linear programs
MaRDI profile type: Publication
full work available at URL: 0377-2217(87)90246-3
OpenAlex ID: W2031779359
cites work: Q3220089
cites work: A forward algorithm and planning horizon procedure for the production smoothing problem without inventory
cites work: Q5181040
cites work: Q4143234
cites work: Q4173179
cites work: The Convex Simplex Method
cites work: Q5591247
Recommended article: A regularized simplex method
Recommended article: Q4437623
Recommended article: A class of convex programming methods
Recommended article: An approximate method for solving the convex programming problem
Recommended article: A Convergent Procedure for Convex Programming
Recommended article: Simplex-inspired algorithms for solving a class of convex programming problems
Recommended article: A continuous method for convex programming problems
Recommended article: A method for solving reverse convex programming problems
Recommended article: Q4499054
Recommended article: Method of orthogonal simplexes and its applications to convex programming
description: scientific article; zbMATH DE number 4003922