In classical graph theory, set of vertices in which every edge is incident to at least one of the vertex is called a vertex covering set and the problems of vertex covering (VC) are known as VC problems. The classical graphs do not reflect the impact of vertex on the edge and such impact is reflected in fuzzy incidence graphs (FIGs). We used optimization technique in a trade using clique covering (CC) in FIGs. This article includes some basic definitions such as strength of clique, strength of path, strength of minimum clique (SMC), acceptable strength of path and acceptable strength of clique, robust number, minimum covering number of the clique, close measure, some examples and theorems in FIGs, and new strategy of optimization to characterize and solve facility point problems by adopting the CC application of FIGs for a business alliance to get maximum total achievement by reducing the transportation cost. This procedure will be helpful to develop sustainable economic developmental goal of the world. Some already existing theorems in fuzzy graphs are also checked in FIGs. A mathematical model is defined and a real-life problem from a trade is solved keeping the fuzziness of the objects related to FIG