Abstract.
We consider a linear programming problem with unknown objective function. Random observations related to the unknown objective function are sequentially available. We define a stochastic algorithm, based on the simplex method, that estimates an optimal solution of the linear programming problem. It is shown that this algorithm converges with probability one to the set of optimal solutions and that its failure probability is of order inversely proportional to the sample size. We also introduce stopping criteria for the algorithm. The asymptotic normality of some suitably defined residuals is also analyzed. The proposed estimation algorithm is motivated by the stochastic approximation algorithms but it introduces a generalization of these techniques when the linear programming problem has several optimal solutions. The proposed algorithm is also close to the stochastic quasi-gradient procedures, though their usual assumptions are weakened.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ash, R.B.: Real Analysis and Probability (Academic Press, New York 1972)
Bazaraa, M.S., Jarvis, J.J.: Linear Programming and Network Flows (John Wiley, New York 1990)
Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming (Springer-Verlag, New York 1997)
Ermoliev, Yu.: Stochastic quasigradient methods and their applications to system optimization. Stoch. Stoch. Rep. 9, 1–36 (1983)
Ermoliev Yu.: Stochastic quasigradient methods. In Numerical Techniques for Stochastic Optimization, Ermoliev Yu., Wets R.J.B., editors (Springer-Verlag, Berlin 1988)
Fabian, V.: On asymptotic normality in stochastic approximation. Ann. Statis. 39, 1327–1332 (1968)
Hall, P., Heyde, C.C.: Martingale Limit Theory and Its Application (Academic Press, New York 1980)
Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Statis. 23, 462–466 (1952)
Kushner, H.J., Yin, G.G.: Stochastic Approximation Algorithms and Applications (Springer-Verlag, New York 1997)
Laha, R.G., Rohatgi V.K.: Probability Theory (John Wiley, New York 1979)
Marti, K.: Descent stochastic quasigradient methods. In Numerical Techniques for Stochastic Optimization. Ermoliev Yu., Wets R.J.B., editors (Springer-Verlag, Berlin 1988)
Pflug, G.Ch.: Stochastic minimization with constant step-size. Asymptotic laws. SIAM J. Control Optim. 24, 655–666 (1986)
Pflug, G.Ch.: Stepsize rules, stopping times and their implementation on stochastic quasigradient algorithms. In Numerical Techniques for Stochastic Optimization, Ermoliev Yu., Wets R.J.B., editors (Springer-Verlag, Berlin 1988)
Prieto-Rumeau, T.: Stochastic algorithms for the estimation of an optimal solution of a LP problem. Convergence and central limit theorem. Technical Report No. 347, Mathematics Dept., CINVESTAV-IPN. Submitted.
Wasan, M.T.: Stochastic Approximation (Cambridge University Press, Cambridge UK 1969)
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (2000): 90C05, 62L20, 90C15
Acknowledgments. I would like to thank two unknown referees for their fruitful suggestions that have helped to improve the paper.
Rights and permissions
About this article
Cite this article
Prieto-Rumeau, T. Estimation of an optimal solution of a LP problem with unknown objective function. Math. Program., Ser. A 101, 463–478 (2004). https://doi.org/10.1007/s10107-003-0482-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-003-0482-7