Multiobjective Linear Programming Problems Research Articles

New Mean and Median Techniques to Solve Multiobjective Linear Fractional Programming Problem and Comparison with Other Techniques

In the field of operation research, both linear and fractional programming problems have been more encountered in recent years because they are more realistic in expressing real-life problems. Fractional programming problem is used when several rates need to be optimized simultaneously such as resource allocation planning, financial and corporate planning, healthcare, and hospital planning. There are several techniques to solve the multiobjective linear fractional programming problem. However, because of the use of scalarization, these techniques have some limitations. This paper proposed two new mean and median techniques to solve the multiobjective linear fractional programming problem by overcoming the limitations. After utilizing mean and median techniques, the problem is converted into an equivalent linear fractional programming problem; then, the linear fractional programming problem is transformed into linear programming problem and solved by the conventional simplex method or mathematical software. Some numerical examples have been illustrated to show the efficiency of the proposed techniques and algorithm. The performance of these solutions was evaluated by comparing their results with other existing methods. The numerical results have shown that the proposed techniques are better than other techniques. Furthermore, the proposed techniques solve a pure multiobjective maximization problem, which is even impossible with some existing techniques. The present investigation can be improved further, which is left for future research.

Ride-Hailing Matching with Uncertain Travel Time: A Novel Interval-Valued Fuzzy Multi-Objective Linear Programming Approach

This study introduces an innovative approach to tackle multi-objective linear programming (MOLP) problems amidst uncertainty, employing interval-valued fuzzy numbers. The method is tailored to resolve ride-hailing matching challenges encompassing uncertain travel times. Findings reveal that managing uncertainty parameters within interval-valued fuzzy MOLP is achieved through strategic reformulations, focusing on constraint coefficients, resulting in streamlined linear programming formulations conducive to solution simplicity. The efficacy of the proposed model in efficiently handling ride-hailing matching quandaries is demonstrated. Moreover, this study delves into the prospective applications of the developed method, including its potential for generalization to address non-linear programming (NLP) issues pertinent to the ride-hailing domain. This research advances decision-making processes under uncertainty and paves the way for broader applications beyond ride-hailing.

Solution of a Multi-Objective Linear Programming Problem having Rough Interval Coefficients using Zero-Sum Game

Solution of a Multi-Objective Linear Programming Problem having Rough Interval Coefficients using Zero-Sum Game

On application of linear fractional programming problem using e-education system

This article focuses on an area of nonlinear programming problems known as linear fractional programming problems with multiple objectives. When tackling real-world linear fractional optimization problems, ambiguity and uncertainty in decision-making are inherent. This research aims to present a simple and computationally quick approach to solving multiple objective linear fractional programming problems with all decision variables and parameters described in terms of crisp. The proposed solution algorithm is based primarily on the fuzzy-based technique, and a membership function strategy. To resolve the multi-objective linear fractional programming problem, first consider the problem as a single objective function and along with the fuzzy programming model obtain the optimal solution using LINGO software. LINGO is a software application primarily used for solving linear, nonlinear, and integer optimization problems Moreover, an e-education setup problem demonstrates the steps of the proposed method.

A novel approach for multi-objective linear programming model under spherical fuzzy environment and its application

Every decision-making process particularly those involving real-life issues is disproportionately plagued by uncertainty. It is also unavoidable and obvious. Since its conception are several ways for representing uncertainty have been proposed by numerous academics to cope with uncertainty. Fuzzy sets and hierarchical such as picture fuzzy sets stand out among them as excellent representation techniques for modeling uncertainty. However, there are several significant drawbacks to the current uncertainty modeling techniques. Due to its vast versatility and benefits we here embrace the idea of the spherical fuzzy set, an extension of the picture fuzzy set. On the other hand amid uncertainty in real life the multi-objective plays a critical role. In this research paper determining a Multi-Objective Linear Programming Problem of Spherical fuzzy sets serves to stimulate nous. The score function corresponding to the degree positive, negative and neutral is the foundation upon which the suggested approach is developed. Additionally we apply the suggested strategy to the solution of the multi-objective linear programming problem to demonstrate its superiority through certain numerical examples. Maximization or Minimizing of the cost is the primary goal of the multi-objective linear programming problem. Using an explicitly defined score function the suggested solution transformed the Spherical Fuzzy Multi-Objective Linear Programming Problem into a Crisp Multi-Objective Linear Programming Problem (CMOLPP). We establish some theorems to show that the efficient solution of CMOLPP is likewise an efficient solution of SFMOLPP. The CMOLPP is then further simplified into a single-objective Linear Programming Problem (LPP) thus we revamp the modified Zimmermann’s approach in the environment of a nonlinear membership function with the aid of the suggested technique. It is possible to simply solve this single-objective LPP using any software or standard LPP algorithm. The suggested approach achieves the fuzzy optimum result without altering the nature of the issue. An application of the suggested approach has been used to illustrate it and its results have been distinguished from those of other preexisting methods found in the literature. To determine the importance of the suggested technique which adjudicate thorough theorem and result analysis is conducted.

Solution of Z-number-based multi-objective linear programming models with different membership functions

In a universe full of fuzziness and uncertainty, it is an absolute blessing if some information is reliable to some degree. Considering the amount of uncertainty, Zadeh proposed the idea of Z-number, which carries both uncertainty and the reliability of the information. Uncertain information can be reliably conveyed using Z-numbers. On the other hand, one of the important and widely used decision-making techniques is linear programming. Currently, linear programming has been extensively explored using fuzzy information. Decisions made using linear programming with uncertain data are highly uncertain due to the lack of reliability of the information. An effective decision-making method is multi-objective linear programming (MOLP), in which the decision-maker attempts to draw conclusions from information containing conflicting attributes. In the MOLP problem, there may be different solution vectors corresponding to each objective function. One needs to find a compromise solution vector that satisfies each objective function to a certain extent based on the decision maker's suggested preferences. In this study, we use Z-number and MOLP to model the Z-number MOLP problem (ZMOLPP). Furthermore, we propose a strategy for solving ZMOLPP by transforming it into a crisp MOLP problem, and finally converting this crisp MOLP problem into a single-objective linear programming problem (LPP) using different shape functions. Additionally, we compare the results with existing MOLP problems in fuzzy settings to validate the proposed strategy.

An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems

AbstractIn this paper, we present an outer approximation algorithm for computing the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices) as well as the facets of the Edgeworth–Pareto hull. We note that these extreme points are the extreme supported non-dominated points of a MOMILP. We also show how to extend the concept of geometric duality for multi-objective linear programming problems to the Edgeworth–Pareto hull of MOMILPs and use this extension to develop the algorithm. The algorithm relies on a novel oracle that solves single-objective weighted-sum problems and we show that the required number of oracle calls is polynomial in the number of facets of the convex hull of the extreme supported non-dominated points in the case of MOMILPs. Thus, for MOMILPs for which the weighted-sum problem is solvable in polynomial time, the facets can be computed with incremental-polynomial delay—a result that was formerly only known for the computation of extreme supported non-dominated points. Our algorithm can be an attractive option to compute lower bound sets within multi-objective branch-and-bound algorithms for solving MOMILPs. This is for several reasons as (i) the algorithm starts from a trivial valid lower bound set then iteratively improves it, thus at any iteration of the algorithm a lower bound set is available; (ii) the algorithm also produces efficient solutions (i.e., solutions in the decision space); (iii) in any iteration of the algorithm, a relaxation of the MOMILP can be solved, and the obtained points and facets still provide a valid lower bound set. Moreover, for the special case of multi-objective linear programming problems, the algorithm solves the problem to global optimality. A computational study on a set of benchmark instances from the literature is provided.

Leveraging Deep Q-Learning to maximize consumer quality of experience in smart grid

The smart grid system has addressed the problems of traditional power grid by not only meeting energy demand in real-time but also limiting its wastage. The two key objectives of a smart grid system are to ensure a higher Quality of Experience (QoE) for consumers and to reduce consumer costs using dynamically varying pricing concepts. However, these two objective parameters oppose each other as maximizing the consumer QoE requires the availability of sufficient electric power at any given time, which in turn increases power purchase cost. In this paper, we introduce an efficient power management system architecture of a smart grid and develop an Optimal Energy Allocation and Prediction system based on Deep Q-Leaning, namely OEAP-DQL, that brings a trade-off between the two. The developed OEAP-DQL system is a multi-objective linear programming (MOLP) problem that predicts consumer electricity demand by exploiting four different weighted and regressive moving average forecasting methods in the action space to accurately capture dynamically varying customer demand behaviors. Furthermore, iterative exploitation of multiple learning methods decreases forecasting error and intelligent stored power management helps the OEAP-DQL smart grid operator (SGO) to enhance its profit. The results of our simulation experiments show that the OEAP-DQL system outperforms the state-of-the-art works in terms of QoE and cost.

Towards neutrosophic Circumstances goal programming approach for solving multi-objective linear fractional programming problems

Indeterminacy is common in practical decision-making circumstances. So the mathematical models of decision making represent the situations in a better way if the parameters are considered as neutrosophic. This article studies a general framework of multi-objective neutrosophic linear fractional programming problem (MONLFPP) and proposes unique approach. The issue's parameters are thought of as triangular neutrosophic numbers. The problem is converted into an equal crisp multi-objective linear programming problem (MOLPP) with the help of variable transformation technique and a ranking function. Fuzzy goal programming is used to solve the MOLPP that has been obtained. Finally, the usefulness of the proposed technique is established using two mathematical models.

Characteristics of Multi-Objective Linear Programming Problem and Multi-Objective Linear Fractional Programming Problem Taking Maximum Value of Multi-Objective Functions

Characteristics of Multi-Objective Linear Programming Problem and Multi-Objective Linear Fractional Programming Problem Taking Maximum Value of Multi-Objective Functions

Enhancing neutrosophic fuzzy goal programming approach for solving multi-objective probabilistic linear programming problems

This article considers a stochastic multi-objective linear programming problem in a neutrosophic framework. The right-hand sides of the constraints are random variables associated with their means and variances, and the single-valued trapezoidal neutrosophic numbers are included in the coefficients of the objective functions to investigate the problem. The problem is successfully converted into the related deterministic programming model based on the formulation of the scoring function and several distributions, such as the Uniform, Exponential, and Gama distributions. Applying fuzzy goal programming, the deterministic problem is solved. An example is then solved to demonstrate the solution methodology.

Solving neutrosophic multi-objective linear fractional programming problem using central measures

In this article, we present different kind of mean technique to solve Multi-Objective Linear Fractional Programming Problem (MOLFPP) in Neutrosophic Environment. Here in these mean techniques the MOLFPP is converted into Single Objective Linear Programming problem(SOLPP) and then we obtained the optimal solution by simplex method in Neutrosophic Environment. The proposed method is illustrated with the help of a numerical example.

A New Method to Solve Fully Intuitionistic Fuzzy Multi-objective Linear Programming Problem Through Conflict and Non-conflict

A New Method to Solve Fully Intuitionistic Fuzzy Multi-objective Linear Programming Problem Through Conflict and Non-conflict

A New Approach to Solve Multi Objective Linear Programming Problem Under Neutrosophic Environment

A New Approach to Solve Multi Objective Linear Programming Problem Under Neutrosophic Environment

Fully fuzzy DEA: a novel additive slacks-based measure model

AbstractThe subject of assessing the relative efficiency of Decision-Making Units (DMUs) has been explored extensively in the literature on Data Envelopment Analysis (DEA). While typical DEA models require exact and conclusive data, the observed values of the inputs and outputs in real-world problems may be inaccurate or ambiguous. This paper presents a novel fully fuzzy DEA (FFDEA) model based on the additive slacks-based measure (ASBM). FFDEA models imply that all inputs, outputs, and variables, are fuzzy. It is demonstrated how fuzzy ranking and fuzzy arithmetic approaches can be used to handle the trapezoidal fuzzy number assumptions. To solve the fuzzy ASBM model under variable returns-to-scale assumptions, we proposed two different methods, first method use of lexicographic method for solving multi-objective linear programming (MOLP) approach, which provides an efficiency measure and a fuzzy goal operating point for each DMU under assessment. In alternative method, we convert the fuzzy linear fractional programming problems to an equivalent MOLP problem. A case study is provided to illustrate the applicability of the proposed approach for selecting sustainable suppliers, we compare the results with other fuzzy DEA approaches, while shedding light on future research venues.

A new geometric approach to multiobjective linear programming problems

A new geometric approach to multiobjective linear programming problems

Fully intuitionistic fuzzy multi-level linear fractional programming problem

In many real situations, it is frequently difficult to accurately determine the membership and non-membership degrees related to an element of the set with complete satisfaction because of the ambiguity in the input data. In instances like these, intuitionistic fuzzy (IF) numbers are crucial. We present a simple approach in this paper to solve the fully intuitionistic fuzzy multi-level linear fractional programming (FIFMLLFP) problem. By applying the new suggested approach to the problem under consideration, each level of the FIFMLLFP problem is converted into five crisp linear (MLMOLFP) problems, where each crisp problem has an additional bounded variables constraint and the upper problems' optimization variables are treated as parameters. This is done by using an iterative technique for linearizing fractional objectives. We converted the MLMOLFP problem into a multilevel multiobjective linear programming (MLMOLP) problem, in addition to the ε-constraint method that is used to reduce MLMOLP problem to a single objective linear programming problem. The method is demonstrated step-by-step with a numerical example.

Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem

Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem

An ε-Constraint Method for Multiobjective Linear Programming in Intuitionistic Fuzzy Environment

Effective decision-making requires well-founded optimization models and algorithms tolerant of real-world uncertainties. In the mid-1980s, intuitionistic fuzzy set theory emerged as another mathematical framework to deal with the uncertainty of subjective judgments and made it possible to represent hesitancy in a decision-making problem. Nowadays, intuitionistic fuzzy multiobjective linear programming (IFMOLP) problems are a topic of extensive research, for which a considerable number of solution approaches are being developed. Among the available solution approaches, ranking function-based approaches stand out for their simplicity to transform these problems into conventional ones. However, these approaches do not always guarantee Pareto optimal solutions. In this study, the concepts of dominance and Pareto optimality are extended to the intuitionistic fuzzy case by using lexicographic criteria for ranking triangular intuitionistic fuzzy numbers (TIFNs). Furthermore, an intuitionistic fuzzy ε-constraint method is proposed to solve IFMOLP problems with TIFNs. The proposed method is illustrated by solving two intuitionistic fuzzy transportation problems addressed in two studies (S. Mahajan and S. K. Gupta’s, “On fully intuitionistic fuzzy multiobjective transportation problems using different membership functions,” Ann Oper Res, vol. 296, no. 1, pp. 211–241, 2021, and Ghosh et al.’s, “Multi-objective fully intuitionistic fuzzy fixed-charge solid transportation problem,” Complex Intell Syst, vol. 7, no. 2, pp. 1009–1023, 2021). Results show that, in contrast with Mahajan and Gupta’s and Ghosh et al.’s methods, the proposed method guarantees Pareto optimality and also makes it possible to obtain multiple solutions to the problems.

Intuitionistic fuzzy optimization method for solving multi-objective linear fractional programming problems

An iterative technique based on the use of parametric functions is proposed in this paper to obtain the best preferred optimal solution of a multi-objective linear fractional programming problem (MOLFPP). Each fractional objective is transformed into a non-fractional parametric function using certain initial values of parameters. The parametric values are iteratively calculated and the intuitionistic fuzzy optimization method is used to solve a multi-objective linear programming problem. Also, some basic properties and operations of an intuitionistic fuzzy set are considered. The development of the proposed algorithm is based on the principle of optimal decision set achieved by the intersection of various intuitionistic fuzzy decision sets which are obtained corresponding to each objective function. Additionally, as the intuitionistic fuzzy optimization method utilizes the degree of belonging and degree of non-belonging, we used the linear membership function for belonging and non-belonging to see its impact on optimization and to get insight into such an optimization process. The proposed approaches have been illustrated with numerical examples.