Flooding from the Indus river and its tributaries has regularly influenced the region of Pakistan. Therefore, in order to limit the misfortune brought about by these inevitable happenings, it requires taking measures to estimate the occurrence and effects of these events. The current study uses flood frequency analysis for the forecast of floods along the Indus river of Pakistan (Tarbela). The peak and volume are the characteristics of a flood that commonly depend on one another. For progressively proficient hazard investigation, a bivariate copula method is used to measure the peak and volume. A univariate analysis of flood data fails to capture the multivariate nature of these data. Copula is the most common technique used for a multivariate analysis of flood data. In this paper, four Archimedean copulas have been tried using the available information, and in light of graphical and measurable tests, the Gumbel Hougaard copula was found to be most appropriate for the data used in this paper. The primary (T^AND, T^OR), conditional and Kendall return periods have been also determined. The copula method was found to be a powerful method for the distribution of marginal variables. It also gives the Kendall return period for the multivariate analysis the consequences of flooding.

The structure of q-rung orthopair fuzzy sets (q-ROFSs) is a generalization of fuzzy sets (FSs), intuitionistic FSs (IFSs), and Pythagorean FSs (PFSs). The notion of q-ROFSs has the proficiency of coping with uncertainty without any restrictions. In addition, the structure of q-ROFSs can effectively cope with the situations involving dual opinions without any restrictions, instead of dealing with only single opinion or dual opinions under certain restrictions. In clustering problems, the correlation coefficients are worthwhile because they provide the degree of similarity or correlation between two elements or sets. The theme of this study is to formulate the correlation coefficients for q-ROFSs that are basically the generalization of correlation coefficients of IFSs and PFSs. Moreover, an application of these correlation coefficients to a clustering problem is proposed. Also, an analysis of the outcomes is carried out. Furthermore, a comparison is carried out among the correlation coefficients for q-ROFSs and the existing ones. Finally, the downsides of the existing works and benefits of the correlation coefficients for q-ROFSs are discussed.

In branch and bound algorithm for integer linear programming the usual approach is incorporating dual simplex method to achieve feasibility for each sub-problem. Although one can also employ the phase 1 simplex method but the simplicity and easy implementation of the dual simplex method bounds the users to use it. In this paper a new technique for handling sub-problems in branch and bound method has been presented, which is an efficient alternative of dual simplex method.

This paper proposes a streamlined form of simplex method which provides some great benefits over traditional simplex method. For instance, it does not need any kind of artificial variables or artificial constraints; it could start with any feasible or infeasible basis of an LP. This method follows the same pivoting sequence as of simplex phase 1 without showing any explicit description of artificial variables which also makes it space efficient. Later in this paper, a dual version of the new method has also been presented which provides a way to easily implement the phase 1 of traditional dual simplex method. For a problem having an initial basis which is both primal and dual infeasible, our methods provide full freedom to the user, that whether to start with primal artificial free version or dual artificial free version without making any reformulation to the LP structure. Last but not the least, it provides a teaching aid for the teachers who want to teach feasibility achievement as a separate topic before teaching optimality achievement.

In this article, we have presented a method for finding the approximate center of a linear programming polytope. This method provides a point near the center of a polytope in few simple and easy steps. Geometrical interpretation and some numerical examples have also been presented to demonstrate the proposed approach and comparison of quality of the center obtained by using the new method with existing methods of finding exact and approximate centers. At the end, we also presented computational results on the randomly generated polytopes to compare the quality of the center obtained by using the new method.

This paper presents new and easy to use versions of primal and dual phase 1 processes which obviate the role of artificial variables and constraints by allowing negative variables into the basis. During the process new method visits the same sequence of corner points as the traditional phase 1 does. The new method is artificial free so, it also avoids stalling and saves degenerate pivots in many cases of linear programming problems.