首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
《Applied Mathematical Modelling》2014,38(15-16):3917-3928
This paper develops an economic order quantity (EOQ) model with uncertain data. For modelling the uncertainty in real-world data, the exponents and coefficients in demand and cost functions are considered as interval data and then, the related model is designed. The proposed model maximises the profit and determines the price, marketing cost and lot sizing with the interval data. Since the model parameters are imprecise, the objective value is imprecise, too. So, the upper and lower bounds are specially formulated for the problem and then, the model is transferred to a geometric program. The resulted geometric program is solved by using the duality approach and the lower and upper bounds are found out for the objective function and variables. Two numerical examples and sensitivity analysis are further used to illustrate the performance of the proposed model.  相似文献   

2.
This paper considers a class of bilevel linear programming problems in which the coefficients of both objective functions are fuzzy random variables. The main idea of this paper is to introduce the Pareto optimal solution in a multi-objective bilevel programming problem as a solution for a fuzzy random bilevel programming problem. To this end, a stochastic interval bilevel linear programming problem is first introduced in terms of α-cuts of fuzzy random variables. On the basis of an order relation of interval numbers and the expectation optimization model, the stochastic interval bilevel linear programming problem can be transformed into a multi-objective bilevel programming problem which is solved by means of weighted linear combination technique. In order to compare different optimal solutions depending on different cuts, two criterions are given to provide the preferable optimal solutions for the upper and lower level decision makers respectively. Finally, a production planning problem is given to demonstrate the feasibility of the proposed approach.  相似文献   

3.
This paper develops an approach to obtaining precise (point) estimates of priorities of objects, in particular, coefficients of importance of criteria. It is assumed that the judgements regarding the preference superiority of one object over another are given in the forms of intervals, that is by indicating the lower and upper bounds. The suggested approach is suitable both in the case of consistent and inconsistent preferences. In the former case, the available intervals are processed by contracting them to the maximum degree, in the latter, by extending them to the minimum degree. The degrees of contraction or extension are regarded as the indexes of indeterminacy or inconsistency of preferences, and treated as multiple objective functions. A method of transformation of such a multicriterial problem to a sequence of several linear programming problems is suggested.  相似文献   

4.
In most real-world situations, the coefficients of decision support models are not exactly known. In this context, it is convenient to consider an extension of traditional mathematical programming models incorporating their intrinsic uncertainty, without assuming the exactness of the model coefficients. Interval programming is one of the tools to tackle uncertainty in mathematical programming models. Moreover, most real-world problems inherently impose the need to consider multiple, conflicting and incommensurate objective functions. This paper provides an illustrated overview of the state of the art of Interval Programming in the context of multiple objective linear programming models.  相似文献   

5.
Rational approximation of vertical segments   总被引:1,自引:0,他引:1  
In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.  相似文献   

6.
Interval programming techniques are a valuable approach for tackling uncertainty in mathematical programming models, because they only require the knowledge of the feasible range of variation of the model coefficients. Nevertheless, the use of these techniques has some limitations, namely when the number of decision variables with interval coefficients is high since the number of objective functions at stake in the sub-problem for testing the (weak) efficiency of each non-basic variable may be easily out of an acceptable computational effort. A similar problem may arise with the number of sub-problems for testing the multi-parametric optimality of each solution obtained (that is, to check whether the solution is possibly optimal or not) and the multi-parametric optimality of each edge by using the all emanating edges algorithm. An alternative algorithm is suggested that allows obtaining all possibly optimal solutions, which fulfill the formal criteria of optimality in a feasible bounded region.  相似文献   

7.
This article considers the bilevel linear programming problem with interval coefficients in both objective functions. We propose a cutting plane method to solve such a problem. In order to obtain the best and worst optimal solutions, two types of cutting plane methods are developed based on the fact that the best and worst optimal solutions of this kind of problem occur at extreme points of its constraint region. The main idea of the proposed methods is to solve a sequence of linear programming problems with cutting planes that are successively introduced until the best and worst optimal solutions are found. Finally, we extend the two algorithms proposed to compute the best and worst optimal solutions of the general bilevel linear programming problem with interval coefficients in the objective functions as well as in the constraints.  相似文献   

8.
We consider linear programming problems with uncertain objective function coefficients. For each coefficient of the objective function, an interval of uncertainty is known, and it is assumed that any coefficient can take on any value from the corresponding interval of uncertainty, regardless of the values taken by other coefficients. It is required to find a minmax regret solution. This problem received considerable attention in the recent literature, but its computational complexity status remained unknown. We prove that the problem is strongly NP-hard. This gives the first known example of a minmax regret optimization problem that is NP-hard in the case of interval-data representation of uncertainty but is polynomially solvable in the case of discrete-scenario representation of uncertainty.  相似文献   

9.
We deal with the linear programming problem in which input data can vary in some given real compact intervals. The aim is to compute the exact range of the optimal value function. We present a general approach to the situation the feasible set is described by an arbitrary linear interval system. Moreover, certain dependencies between the constraint matrix coefficients can be involved. As long as we are able to characterize the primal and dual solution set (the set of all possible primal and dual feasible solutions, respectively), the bounds of the objective function result from two nonlinear programming problems. We demonstrate our approach on various cases of the interval linear programming problem (with and without dependencies).  相似文献   

10.
In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at finding a set of robust solutions that covers all possible uncertainty set outcomes. We refer to these problems as robust optimization with variable-sized uncertainty. We discuss how to construct smallest possible sets of min–max robust solutions and give bounds on their size.A special case of this perspective is to analyze for which uncertainty sets a nominal solution ceases to be a robust solution, which amounts to an inverse robust optimization problem. We consider this problem with a min–max regret objective and present mixed-integer linear programming formulations that can be applied to construct suitable uncertainty sets.Results on both variable-sized uncertainty and inverse problems are further supported with experimental data.  相似文献   

11.
This paper proposes a column generation approach based on the Lagrangean relaxation with clusters to solve the unconstrained binary quadratic programming problem that consists of maximizing a quadratic objective function by the choice of suitable values for binary decision variables. The proposed method treats a mixed binary linear model for the quadratic problem with constraints represented by a graph. This graph is partitioned in clusters of vertices forming sub-problems whose solutions use the dual variables obtained by a coordinator problem. The column generation process presents alternative ways to find upper and lower bounds for the quadratic problem. Computational experiments were performed using hard instances and the proposed method was compared against other methods presenting improved results for most of these instances.  相似文献   

12.
We prove the existence of positive solutions of second-order nonlinear differential equations on a finite interval with periodic boundary conditions and give upper and lower bounds for these positive solutions. Obtained results yield positive periodic solutions of the equation on the whole real axis, provided that the coefficients are periodic.  相似文献   

13.
The out-of-kilter algorithm finds a minimum cost assignment of flows to a network defined in terms of one-way arcs, each with upper and lower bounds on flow, and a cost. It is a mathematical programming algorithm which exploits the network structure of the data. The objective function, being the sum taken over all the arcs of the products, cost×flow, is linear. The algorithm is applied in a new way to minimise a series of linear functions in a heuristic method to reduce the value of a non-convex quadratic function which is a measure of traffic congestion. The coefficients in these linear functions are chosen in a way which avoids one of the pitfalls occurring when Beale's method is applied to such a quadratic function. The method does not guarantee optimality but has produced optimal results with networks small enough for an integer linear programming method to be feasible.  相似文献   

14.
The numerical method is proposed in this article to solve a general class of continuous-time linear programming problems in which the functions appeared in the coefficients of this problem are assumed to be piecewise continuous. In order to make sure that all the subintervals of time interval will not contain the discontinuities, a different methodology for not equally partitioning the time interval is proposed. The main issue of this article is to obtain an analytic formula of error upper bound. In this article, we shall propose two kinds of computational procedure to evaluate the error upper bounds. One needs to solve the dual problem of the discretized linear programming problem, and another one does not need to solve the dual problem. Finally, we present a numerical example to demonstrate the usefulness of the numerical method.  相似文献   

15.
The mean value cross decomposition method for linear programming problems is a modification of ordinary cross decomposition, that eliminates the need for using the Benders or Dantzig-Wolfe master problems. As input to the dual subproblem the average of a part of all known dual solutions of the primal subproblem is used, and as input to the primal subproblem the average of a part of all known primal solutions of the dual subproblem. In this paper we study the lower bounds on the optimal objective function value of (linear) pure integer programming problems obtainable by the application of mean value cross decomposition, and find that this approach can be used to get lower bounds ranging from the bound obtained by the LP-relaxation to the bound obtained by the Lagrangean dual. We examplify by applying the technique to the clustering problem and give some preliminary computational results.  相似文献   

16.
In multiple objective decision making (MODM), it is often helpful to provide the decision maker (DM) with bounds on the values of each of the objectives. Ideal solutions are relatively easy to calculate and provide upper bounds on the value of each objective over the set of efficient solutions. Ideal solutions also provide lower bounds on the value of each objective over the ideal set. However, the lower bounds over the set of efficient solutions can be strictly less than the ideal lower bounds, but are, in general, more difficult to determine. Thus MODM procedures which utilize the ideal lower bound may overlook elements of the set of efficient solutions. This study explores the differences between the subset of the set of efficient solutions to a MODM problem bounded by its ideal solutions and the complete efficient set.  相似文献   

17.
A multiobjective binary integer programming model for R&D project portfolio selection with competing objectives is developed when problem coefficients in both objective functions and constraints are uncertain. Robust optimization is used in dealing with uncertainty while an interactive procedure is used in making tradeoffs among the multiple objectives. Robust nondominated solutions are generated by solving the linearized counterpart of the robust augmented weighted Tchebycheff programs. A decision maker’s most preferred solution is identified in the interactive robust weighted Tchebycheff procedure by progressively eliciting and incorporating the decision maker’s preference information into the solution process. An example is presented to illustrate the solution approach and performance. The developed approach can also be applied to general multiobjective mixed integer programming problems.  相似文献   

18.
Bounded knapsack sharing   总被引:1,自引:0,他引:1  
A bounded knapsack sharing problem is a maximin or minimax mathematical programming problem with one or more linear inequality constraints, an objective function composed of single variable continuous functions called tradeoff functions, and lower and upper bounds on the variables. A single constraint problem which can have negative or positive constraint coefficients and any type of continuous tradeoff functions (including multi-modal, multiple-valued and staircase functions) is considered first. Limiting conditions where the optimal value of a variable may be plus or minus infinity are explicitly considered. A preprocessor procedure to transform any single constraint problem to a finite form problem (an optimal feasible solution exists with finite variable values) is developed. Optimality conditions and three algorithms are then developed for the finite form problem. For piecewise linear tradeoff functions, the preprocessor and algorithms are polynomially bounded. The preprocessor is then modified to handle bounded knapsack sharing problems with multiple constraints. An optimality condition and algorithm is developed for the multiple constraint finite form problem. For multiple constraints, the time needed for the multiple constraint finite form algorithm is the time needed to solve a single constraint finite form problem multiplied by the number of constraints. Some multiple constraint problems cannot be transformed to multiple constraint finite form problems.  相似文献   

19.
In this paper we propose two time-indexed IP formulations for job-shop scheduling problems with a min-sum objective. The first model has variables associated to job scheduling patterns. The exponential number of variables calls for a column generation scheme which is carried out by a dynamic programming procedure. The second model is of network flow type with side constraints. This model can be strengthened by adding cutting inequalities of clique type. It turns out that the two models are equivalent, since the dual of the second formulation is equivalent to the compact dual of the first model. However, they require significantly different solution approaches and may behave differently in terms of computing time and memory usage. Good upper bounds are found by a heuristic procedure that randomly generates schedules from fractional solutions. These features allow for an effective pruning of the branch-and-bound tree and narrowing the gap between lower and upper bounds. However, the size of both models is critically affected by the time-indexed formulation which may heavily slow down the computation.  相似文献   

20.
We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号