![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
During the last two decades we have seen a very rapid development in information technology and software development. Infact, the software developer's aims to develop reliable software at minimum cost and they try to release at appropriate time. Software testing is an important phase in software Development Life Cycle (SDLC). Usually, software contains a number of different modules to perform specific functions that are tested independently by unit test. In real life, it is not possible to perfectly debug all faults from a module during testing phase. Our aim is to remove maximum number of faults from each module within the specified resource budget at the minimum cost. The purpose of this paper is to discuss two types of optimization problems. The first optimization problem is corresponding to bicriteria problem in which we have considered the maximum fault removal from each module with minimum cost, subject to total allocated resource budget. Since the software developers desire to remove at least some number of faults from each module, so an aspiration level of fault removal from each module is introduced in the second optimization problem. Finally numerical examples are given to illustrate the correctness of the problem.