Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function

DOI10.1007/BF01585925zbMATH Open0841.90092MaRDI QIDQ1904656FDOQ1904656

Authors: András Prékopa, Wen-Zhong Li 

Publication date: 24 July 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3902406
• On a dual method for a specially structured linear programming problem with application to stochastic programming
• On the Resolution of Linearly Constrained Convex Minimization Problems
• scientific article
• Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems

zbMATH Keywords

linearly constrained optimizationpolyhedral functionsfast bounding techniquesimplicial functions

Mathematics Subject Classification ID

Linear programming (90C05) Stochastic programming (90C15)

Cites Work

• Title not available (Why is that?)
• New bounds and approximations for the probability distribution of the length of the critical path
• Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
• New Finite Pivoting Rules for the Simplex Method
• Title not available (Why is that?)
• Computational experience with a primal-dual interior point method for linear programming
• Decomposing the requirement space of a transporation problem into polyhedral cones

Cited In (8)

• Title not available (Why is that?)
• On the Resolution of Linearly Constrained Convex Minimization Problems
• On strong unimodality of multivariate discrete distributions
• A fast method for a class of one-stage bounded variables and single constrained linear programming problems
• On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem
• Apex duality for constrained optimization
• Title not available (Why is that?)
• On a dual method for a specially structured linear programming problem with application to stochastic programming

This page was built for publication: Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904656)