This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
No Special Schemes Are Needed for Solving Software Reliability Optimization Models
August 1995 (vol. 21 no. 8)
pp. 701-702
This paper resolves four previous software reliability optimization models published in this journal. It is shown that a recent optimization software, LINGO, makes it unnecessary to develop special branch and bound or dynamic programming schemes to solve nonlinear reliability optimization models with binary decision variables.

[1] O. Berman and N. Ashrafi,“Optimization models for reliability of modularsoftware systems,” IEEE Trans. Software Engineering, vol. 19, pp. 1,119-1,123, 1993.
[2] B. Borchers and J.E. Mitchell,“An improved branch and bound algorithm formixed integer nonlinear programs,” Comp. Ops. Res., vol. 21, pp. 359-367, 1994.
[3] W.J. Lee, et al., “A branch and bound algorithm for solving separableconvex integer programming problems,” Comp. Ops. Res., vol. 21, p. 1,011, 1994.
[4] J.L. Liebman, et al., Modelling and Optimization with GINO.Redwood City, Calif.: Scientific Press, 1986.
[5] LINDO Systems Inc., LINGO Optimization Modelling Language.Chicago: LINDO Systems Inc., 1993.
[6] E. Wasil, et al., “State of the art in nonlinear optimization software forthe microcomputer,” Comp. Ops. Res., vol. 16, pp. 497-512, 1989.

Index Terms:
Software reliability, optimization, nonlinear binary programming.
Citation:
Hüseyin Sarper, "No Special Schemes Are Needed for Solving Software Reliability Optimization Models," IEEE Transactions on Software Engineering, vol. 21, no. 8, pp. 701-702, Aug. 1995, doi:10.1109/32.403793
Usage of this product signifies your acceptance of the Terms of Use.