Author:
dos Santos Marcos Augusto,Oliveira Paulo Roberto
Reference26 articles.
1. Atkinson, D. S. and Vaidya, P. (1995). A cutting plane algorithm for convex programming that uses analytic centers. Mathematical Programming, (69):1–4.
2. Bahn, O., Merle O. du, Goffin, J. L., and Vial, J. P. (1995). A cutting plane method from analytic centers for stochastic programming. Mathematical Programming, (69):45–73.
3. Dantzig, G. B. and Wolfe, P. (1960). The decomposition algorithm for linear programs. Operations Research, (8):101–111.
4. Dantzig, G. B. and Ye, Y. (1990). A build-up interior method for linear programming: affine scaling form. Technical Report Sol 90–4, Dept. of Operations Research, Stanford, USA.
5. Den Hertog, D. (1992). Interior point approach to linear, quadratic and convex programming: algorithms and complexity. PhD thesis, University of Technology, Delft, The Netherlands.