Multiobjective Programming Problems Research Articles

Consumer service level-oriented resilience optimisation for e-commerce supply chain considering hybrid strategies with blockchain adoption

ABSTRACT The booming development of customised e-commerce makes e-commerce supply chains experience a severe test of consumer service level (CSL). An efficient e-commerce supply chain resilience optimisation method addressing economic performance and service performance is proposed to improve customised services under disruption risks. The proposed method includes a hybrid strategy considering both a resistance strategy with blockchain (BCT) adoption and time-dependent recovery strategies simultaneously. A two-stage multi-period multi-product stochastic programming with BCT adoption is then proposed, which (1) implements BCT as the resistance strategy in the pre-disruption stage; (2) collaborates four recovery strategies in the post-disruption stage; (3) supports the e-tailer in making decisions and optimises his profit and order fulfillment time while taking product priorities into account. Using the actual data of Chinese e-commerce during the public health emergency in 2020, it is demonstrated that (1) the applicability of the model with BCT adoption in both supply chain resilience and CSL improvement; (2) the performance of the hybrid strategy in long-term disruption management; (3) the efficiency and robustness of the proposed solution approach for multi-objective high-dimensional stochastic programming problems. E-tailers can optimise decision-making under long-term disruptions by the proposed methodology in practices.

Constraint Qualifications for Nonsmooth Multiobjective Programming Problems with Switching Constraints on Hadamard Manifolds

Constraint Qualifications for Nonsmooth Multiobjective Programming Problems with Switching Constraints on Hadamard Manifolds

Solving Convex Multi-Objective Optimization Problems via a Capable Neural Network Scheme

A neural network architecture is constructed to solve Convex Multi-objective Programming Problem (CMPP). By using the weighted sum method, a single-objective optimization problem related to the CMPP is formulated, in which the scalar objective is summation of weighted original objective functions. The Pareto Optimal Solution (POS) is given by using different values of weights. A neural network framework is then designed for solving the obtained convex problem. Based on employing Lyapunov theory, the proposed model is established to be stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the convex programming problem with different values of weights. The computer simulations shows the feasibility and the efficiency of the suggested model.

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.

Sensitivity Analysis of the Cost Coefficients in Multiobjective Integer Linear Optimization

This paper considers sensitivity analysis of the cost coefficients in multiobjective integer linear programming problems. We define the sensitivity region as the set of simultaneous changes to the coefficients for which the efficient set and its structure remain the same. In particular, we require that the component-wise relation between efficient solutions is preserved and that inefficient solutions remain inefficient, and we show that this is sufficient for the efficient set to be the same upon changes. For a single coefficient, we show that a subset of the inefficient solutions can be excluded from consideration. More specifically, we prove that it suffices to inspect the inefficient solutions of a q-objective problem that are efficient in one of two related q + 1-objective problems. Finally, we show that the sensitivity region is a convex set (an interval). Our approach generalizes to simultaneous changes in multiple coefficients. For illustration, we consider mean-variance capital budgeting and determine the region for which the set of efficient portfolios remains the same, despite a misspecification or a change in the net present values of the projects. Further computational experience with multiobjective binary and integer knapsack problems demonstrates the general applicability of our technique. For instance, we obtain all sensitivity intervals for changes to single coefficients of biobjective problems with 500 binary variables in less than half an hour of CPU time by excluding a large number of inefficient solutions. In fact, the number of excluded solutions is above 100 orders of magnitude larger than the number of remaining solutions. This paper was accepted by Chung Piaw Teo, optimization. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.01406 .

New techniques to improve neighborhood exploration in pareto local search

Pareto Local Search (PLS) is an extension of local search to multiobjective combinatorial optimization problems (MCOPs). It is widely used as a building block in many multiobjective metaheuristics. However, it suffers from poor anytime behavior and long convergence time. In this paper, we focus on improving the neighborhood exploration mechanism to accelerate PLS. In total, we propose three new search strategies, namely, Promising List, Don’t Look Bits and Continuing Search and implement them on the multiobjective Traveling Salesman Problem (mTSP) and the multiobjective Unconstrained Binary Quadratic Programming (mUBQP) problem. In Promising List, features of problem structure are utilized to guide the local search. In Don’t Look Bits, neighborhood moves that are less promising to produce improving solutions are skipped. In Continuing Search, the agent will start from where previous neighborhood exploration stops to avoid repetitive neighborhood moves. The experimental results verify the effectiveness of the three techniques both individually and collaboratively on most of the test instances. Besides, one proposed PLS variant outperforms two state-of-the-art PLS-based algorithms.

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.

A fuzzy mathematical model to solve multi-objective trapezoidal fuzzy fractional programming problems

A fuzzy mathematical model to solve multi-objective trapezoidal fuzzy fractional programming problems

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 simple, efficient and versatile objective space algorithm for multiobjective integer programming

AbstractIn the last years a multitude of algorithms have been proposed to solve multiobjective integer programming problems. However, only few authors offer open-source implementations. On the other hand, new methods are typically compared to code that is publicly available, even if this code is known to be outperformed. In this paper, we aim to overcome this problem by proposing a new state-of-the-art algorithm with an open-source implementation in . The underlying method falls into the class of objective space methods, i.e., it decomposes the overall problem into a series of scalarized subproblems that can be solved with efficient single-objective IP-solvers. It keeps the number of required subproblems small by avoiding redundancies, and it can be combined with different scalarizations that all lead to comparably simple subproblems. Our algorithm bases on previous results but combines them in a new way. Numerical experiments with up to ten objectives validate that the method is efficient and that it scales well to higher dimensional problems.

Efficient solutions for vector optimization problem on an extended interval vector space and its application to portfolio optimization

In this paper, a generalized interval vector space is investigated and defined as an ordered relation in the form of a bijective linear transformation of its onto a real vector space. The ordered relation is utilized to formulate an interval optimization problem in the same manner as a classical multi-objective programming problem. A methodology that addresses the existence of efficient solutions for the multi-objective interval optimization problem has also been discussed. Various numerical examples are described to illustrate and substantiate all developed concepts. Furthermore, the multi-objective portfolio rebalancing problem for a time horizon is designed based on the developed interval vector optimization. An algorithm using exhaustive solution technology has been proposed to achieve an efficient investment strategy. Finally, its applicability and efficacy are analyzed using Bombay Stock Exchange India data sets.

A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces

In this paper, we introduce a new approximation approach for a class of multiobjective programming problems in complex spaces and their duals. Using a sublinear functional, an approximated problem is constructed at a given feasible solution of the original problem. The equivalence between the solution of the considered multiobjective complex programming problem and its approximated problem is established by deriving the sufficiency theorem under the F-convexity assumption. An example showing this equivalence is also presented. Further, corresponding to the approximated problem, the Mond–Weir and Wolfe-type approximated dual problems are formulated. The duality results for the Mond–Weir and Wolfe-type dual problems are derived using the duality results established for the approximated Mond–Weir and Wolfe-type dual problems, respectively. The importance of the optimality conditions and proposed approximation approach is highlighted in a blind equalization problem in a communication system.

Merging decision-making units in the simultaneous presence of desirable and undesirable factors

This paper is devoted to applying the inverse Data Envelopment Analysis (InvDEA) in the simultaneous presence of desirable and undesirable factors. One of the most common ways to improve units’ performance in the business environment is through activity synergies called units’ merging. The present study models how to identify the inherited input/output from the units participating in the merger process to achieve the desired efficiency goal. The proposed models are established based on the InvDEA approach and multiple-objective programming tools. Sufficient conditions to estimate desirable and undesirable data are obtained using Pareto solutions to multi-objective programming problems. The theory extended in the study is explained by an application in the banking sector.

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.

Solving Multi Objective Programming Problems Using Target Setting in DEA

Solving Multi Objective Programming Problems Using Target Setting in DEA

Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds

Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds

Multi-objective non-linear programming problem with rough interval parameters: an application in municipal solid waste management

In dealing with the real-world optimization problems, a decision-maker has to frequently face the ambiguity and hesitancy due to various uncontrollable circumstances. Rough set theory has emerged as an indispensable tool for representing this ambiguity because of its characteristic of incorporating agreement and understanding of all the involved specialists and producing more realistic conclusions. This paper studies an application of the rough set theory for a multi-objective non-linear programming problem that originates for the management of solid wastes. Municipal solid waste management is a global problem that affects every country. Because of the poor waste management system in many nations, the bulk of municipal solid waste is disposed of in open landfills with no recovery mechanism. Hence, an effective and long term waste management strategy is the demand of the day. This research offers an incinerating, composting, recycling, and disposing system for the long-term management of the municipal solid waste. A model for the municipal solid waste management with the goal of minimizing the cost of waste transportation, cost of waste treatment and maximizing the revenue generated from various treatment facilities is developed under rough interval environment. To tackle the conflicting nature of different objectives, an approach is proposed that gives the optimistic and pessimistic views of the decision-maker for optimizing the proposed model. Also, the biasness/preference of the decision-maker for a specific objective is handled by establishing the respective non-linear membership and non-membership functions instead of the linear ones. Finally, to demonstrates the practicality of the proposed methodology, a case study is solved and the obtained Pareto-optimal solution has been compared to those obtained by the existing approaches.

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.

An Accuracy-Aware Energy-Efficient Multipath Routing Algorithm for WSNs.

In the fields of industrial production or safety monitoring, wireless sensor networks are often content with unreliable and time-varying channels that are susceptible to interference. Consequently, ensuring both transmission reliability and data accuracy has garnered substantial attention in recent years. Although multipath routing-based schemes can provide transmission reliability for wireless sensor networks, achieving high data accuracy simultaneously remains challenging. To address this issue, an Energy-efficient Multipath Routing algorithm balancing data Accuracy and transmission Reliability (EMRAR) is proposed to balance the reliability and accuracy of data transmission. The multipath routing problem is formulated into a multi-objective programming problem aimed at optimizing both reliability and power consumption while adhering to data accuracy constraints. To obtain the solution of the multi-objective programming, an adaptive artificial immune algorithm is employed, in which the antibody initialization method, antibody incentive calculation method, and immune operation are improved, especially for the multipath routing scheme. Simulation results show that the EMRAR algorithm effectively balances data accuracy and transmission reliability while also saving energy when compared to existing algorithms.

Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints

The objective of this paper is to investigate multiobjective semi-infinite programming problems with vanishing constraints (in brief, MSIPVC). We firstly propose both the vector Lagrange dual problems and the scalarized Lagrange dual problems for MSIPVC and explore duality relations under convexity assumptions. Then, the saddle point optimality conditions for MSIPVC are considered. Some examples are also given to illuminate the main results.