Multiple Objective Programming Research Articles

Solving a sealed-bid reverse auction problem by multiple-criterion decision-making methods

This study presents a model for solving the sealed-bid, multiple-issue reverse auction problem, using multiple-criterion decision-making approaches, such that the interests of both the buyer and the supplier are satisfied. On the supplier side, the bid construction process is formulated as a fuzzy multiple-objective programming problem, and is solved using an exhausted enumeration algorithm which adjusts the production plan in accordance with the buyer’s demand, based on the current master production schedule (MPS) and the available-to-promise (ATP) inventory. The use of the information of MPS and ATP enables the supplier to make accurate estimates of the production costs associated with specific delivery dates, and thus facilitates the construction of a bid which is both profitable and likely to secure the contract. On the buyer side, the winner determination process is treated as a multiple-attribute decision-making problem, and is solved using the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method. The validity of the proposed approach is demonstrated via an illustrative example.

Vector measure as controls for explicit nonlinear impulsive system of fed-batch culture

In this paper, we consider an optimal control problem of microbial fermentation process in which glycerol is converted to 1,3-propanediol by Klebsiella pneumoniae in fed-batch culture. During the period of reaction, the variation of pH value is monitored to determine glycerol replenishment quantity, guaranteeing that microorganism can always keep growing fast under enough nutrition. Every time pH value is lower than seven, the quantity of glycerol added is such that pH value returns seven again. Glycerol is poured into reactor at discrete time instant and the quantity is controllable. The problem is to determine for each discrete time instant the glycerol quantity to add and maximize the final concentration of 1,3-propanediol. We present a controlled explicit nonlinear impulsive dynamical system of fed-batch culture with state independent vector measures as controls and study the existence, uniqueness, boundedness, continuous dependence and Gâteaux differentiability of its solution with respect to controls. We then propose a multiple objective programming model and demonstrate the regularity of cost functionals and weak compactness of admissible control set. Finally we discuss the existence of optimal control and implement a hybrid particle swarm optimization algorithm to solve the model optimally. Computational results are presented on a numerical example.

Solving Bilevel Linear Programs Using Multiple Objective Linear Programming

We present an algorithm for solving bilevel linear programs that uses simplex pivots on an expanded tableau. The algorithm uses the relationship between multiple objective linear programs and bilevel linear programs along with results for minimizing a linear objective over the efficient set for a multiple objective problem. Results in multiple objective programming needed are presented. We report computational experience demonstrating that this approach is more effective than a standard branch-and-bound algorithm when the number of leader variables is small.

Resource allocation based on the DEA model

The purpose of this paper is to develop an approach to a resource-allocation problem that typically appears in organizations with a centralized decision-making environment, for example, police stations, banks, and universities. The central unit is assumed to be interested in maximizing both the total efficiency and the efficiency of the individual unit by allocating available resources to them. Building upon this, we present a data envelopment analysis-based model for allocating input resources to DMUs (the decision-making units) under the framework of multiple objective programming. Numerical examples are used to illustrate the approach.

A positive approach to estimating the weights for quadratic multiple objective programming

This paper integrates positive and normative approaches to modelling. The normative approach uses assumptions associated with multiple objective programming. The positive approach uses past observations to estimate the weights associated with each objective criteria. The technique encompasses both linear and non-linear objectives such as profit, cost and risk as well as quadratic calibration terms. The proposed methodology minimizes the sum of squared errors about the ideal multiple objective function, that is one that would reproduce observed results, rather than to minimize errors between fitted and observed activity levels. The technique removes the need to rely upon the use of abstract restraints normally applied to mathematical programming methods and provides a more objective means of testing the appropriateness of a model than previously. The technique has many applications in the field of mathematical modelling such as forecasting and analysing changes in decision-making and behaviour.

A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs

We present an algorithm for generating a subset of non-dominated vectors of multiple objective mixed integer linear programming. Starting from an initial non-dominated vector, the procedure finds at each iteration a new one that maximizes the infinity-norm distance from the set dominated by the previously found solutions. When all variables are integer, it can generate the whole set of non-dominated vectors.

An integrated approach for deriving priorities in analytic network process

A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an inconsistent situation. The weakness of the ANP and fuzzy ANP (FANP) is that the complexity of generating priorities is equal to the number of comparison matrices. In the proposed approach, all sets of crisp priorities for each pairwise comparison matrix can be obtained directly. Moreover, from the outcomes of three examples, the power to reach a limiting supermatrix is less than or equal to the power of the FANP. Thus, the proposed approach can be regarded as an efficient alternative of the fuzzy ANP.

Personal financial planning based on fuzzy multiple objective programming

Personal financial planning involves managing all the money activities during a planner's lifetime. Traditional personal financial planning procedures begin with the planner's financial status, goals, and expectations for the future before future cash flows of different time periods under various scenarios can be determined. If the planning results fail to meet the planner's expectation, the planner adjusts tunable parameters repeatedly until an acceptable financial arrangement can be obtained. Such a ''trial-and-error approach'' or ''what-if analysis'' does not promise to achieve the optimal plan while numerous outcomes burden the planner. Multiple objectives with different goals of different importance levels might be involved in this decision-making problem. Since the objectives tend to conflict with each other, this study proposes to solve the problem based on a decision model that incorporates a fuzzy multiple objective programming method to achieve better solutions than using ''trial-and-error''.

A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming

In this paper a new algorithm is proposed to determine efficient max-ordering optimal solutions in multiple objective programming (MOP). In fact, the max-ordering optimal solution is not necessarily efficient, and could be weakly efficient. In this paper a new algorithm is proposed which is capable to overcome this problem, and has computational advantages as compared to the customary method.

A two-phase approach for multi-objective programming problems with fuzzy coefficients

In this study, a two-phase procedure is introduced to solve multi-objective fuzzy linear programming problems. The procedure provides a practical solution approach, which is an integration of fuzzy parametric programming (FPP) and fuzzy linear programming (FLP), for solving real life multiple objective programming problems with all fuzzy coefficients. The interactive concept of the procedure is performed to reach simultaneous optimal solutions for all objective functions for different grades of precision according to the preferences of the decision-maker (DM). The procedure can be also performed to obtain lexicographic optimal and/or additive solutions if it is needed. In the first phase of the procedure, a family of vector optimization models is constructed by using FPP. Then in the second phase, each model is solved by FLP. The solutions are optimal and each one is an alternative decision plan for the DM.

Urban dynamics and multiple-objective programming: A case study of Beijing

This study serves as a primary application of the integrated system dynamics and multiple-objective programming (ISDMOP) model for strategic planning of Beijing city, which is here divided into six subsystems as population, resources, energy, economy, environment and ecosystem, with the planning horizon spanning from 2003 to 2020. Comparison between the original system dynamics (ORSD) model based on the existing economic structure of Beijing and the optimized system dynamics (OPSD) model adjusted according to the solutions of the multiple-objective programming (MOP) are conducted. The developing trend of each subsystem is simulated and illuminated, based on which constructive suggestions are provided for urban strategic planning of Beijing. The ISDMOP model is proved effective for investigating urban dynamics and realizing the multiple-objective programming.

Stability achievement scalarization function for multiobjective nonlinear programming problems

In this paper, we present a method to determine the stability of nondominated criterion vectors using a modified weighted achievement scalarization metric. This method is based on the application of a particular objective function which scalarizes and parameterizes the original multiobjective nonlinear programming problem. Also, we show that this modified weighted achievement metric coincides with the metric introduced by Choo and Atkins [E.-U. Choo, D.R. Atkins, Proper efficiency in nonconvex multicriteria programming, Math. Oper. Res. 8 (1983) 467–470] and Kaliszewski [I. Kaliszewski, A modified weighted Tchebycheff metric for multiple objective programming, Comput. Oper. Res. 14 (1987) 315–323] in cases when sets of all criterion vectors are finite or polyhedral.

Optimality for nonsmooth fractional multiple objective programming

In this study the necessary and sufficient optimality conditions for nonsmooth fractional multiple objective optimization problems are provided. Our idea is based on using the properties of limiting subdifferential vectors in nonsmooth analysis and a separation theorem in convex analysis.

A dual-based algorithm for solving lexicographic multiple objective programs

In this paper, we propose an algorithm for solving lexicographic multiple objective programs based upon duality theorem. In the existing algorithm, we should solve several linear programming problems (LPPs); therefore if, in particular, there are several objective functions, this method is not worthwhile from the viewpoint of computation. But in our new algorithm we just solve one LPP.

SOLVING THE FUZZY SHORTEST PATH PROBLEM BY USING A LINEAR MULTIPLE OBJECTIVE PROGRAMMING

ABSTRACT In this paper, we propose a simple linear multiple objective programming to deal with the fuzzy shortest path problem. The proposed approach does not need to declare 0-1 variables to solve the fuzzy shortest path problem because it meets the requirements of the network linear programming constraints. Therefore, the linear programming relaxation can be used to arrive at an integer solution without using the Branch and Bound technique, and the complexity of our proposed method can be reduced. A compromising non-dominated integer optimal solution, the fuzzy shortest path, can be obtained easily without adding extra constraints. This approach not only can obtain a fuzzy shortest path but also can reduce the complexity of solving the basic fuzzy shortest path problem without using 0-1 variables. Three examples with trapezoidal and triangular fuzzy numbers in arc length are used to demonstrate the proposed method in more details.

Multiple-objective programs in Banach spaces: Sufficiency for (proper) optimality

This paper establishes some sufficient conditions for optimality and proper optimality for multiple-objective programs in Banach spaces, after extending the concept of vector invexity.

Exact generation of epsilon-efficient solutions in multiple objective programming

It is a common characteristic of many multiple objective programming problems that the efficient solution set can only be identified in approximation: as this set often contains an infinite number of points, only a discrete representation can be computed, and due to numerical difficulties, each of these points itself might, in general, be only approximate to some efficient point. From among the various approximation concepts, this paper considers the notion of epsilon-efficient solutions and proposes several new methods for their generation. Supporting theoretical results are established and a numerical example is provided.

Fuzzy convexity and multiobjective convex optimization problems

In this paper, based on the more restrictive definition of fuzzy convexity due to Ammar and Metz [1], several useful composition rules are developed. The advantages in using the more restrictive definition of fuzzy convexity are that local optimality implies global optimality, and that any convex combination of such convex fuzzy sets is also a convex fuzzy set. As shown in this paper, these properties are laking in the usual convex fuzzy sets. In addition, to illustrate the applications in fuzzy convex optimization, two examples in multiple objective programming are considered.

Constrained optimization using multiple objective programming

In practical applications of mathematical programming it is frequently observed that the decision maker prefers apparently suboptimal solutions. A natural explanation for this phenomenon is that the applied mathematical model was not sufficiently realistic and did not fully represent all the decision makers criteria and constraints. Since multicriteria optimization approaches are specifically designed to incorporate such complex preference structures, they gain more and more importance in application areas as, for example, engineering design and capital budgeting. The aim of this paper is to analyze optimization problems both from a constrained programming and a multicriteria programming perspective. It is shown that both formulations share important properties, and that many classical solution approaches have correspondences in the respective models. The analysis naturally leads to a discussion of the applicability of some recent approximation techniques for multicriteria programming problems for the approximation of optimal solutions and of Lagrange multipliers in convex constrained programming. Convergence results are proven for convex and nonconvex problems.

A CHIM-based interactive Tchebycheff procedure for multiple objective decision making

This study presents a new solution procedure for multiple objective programming (MOP). It applies the concept of the normal boundary intersection (NBI) within the framework of the interactive weigh...