New Methods in Mathematical Programming—On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem
From MaRDI portal
Publication:3845824
DOI10.1287/opre.10.4.471zbMath0109.14101OpenAlexW2126096360MaRDI QIDQ3845824
Publication date: 1962
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.10.4.471
Related Items (6)
Envelope Theorems for Multistage Linear Stochastic Optimization ⋮ Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location ⋮ Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming ⋮ On varying all the parameters in a linear fractional functionals programming problem ⋮ General parametric linear fractional programming ⋮ On the optimal value function for certain linear programs with unbounded optimal solution sets
This page was built for publication: New Methods in Mathematical Programming—On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem
