Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function
type: Item
instance of: scholarly article
title: Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function
zbMATH Open document ID: 0841.90092
DOI: 10.1007/BF01585925
published in: Mathematical Programming. Series A. Series B
publication date: 1996-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 829915
zbMATH Keywords: polyhedral functions
zbMATH Keywords: simplicial functions
zbMATH Keywords: linearly constrained optimization
zbMATH Keywords: fast bounding technique
author: András Prékopa
author: Wen-Zhong Li
MaRDI profile type: Publication
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Q3288565
cites work: Q5336851
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
cites work: Q5439479
cites work: Decomposing the requirement space of a transporation problem into polyhedral cones
description: scientific article; zbMATH DE number 829915