首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Existing techniques for solving nonconvex programming problems often rely on the availability of lower and upper bounds on the problem variables. This paper develops a method for obtaining these bounds when not all of them are availablea priori. The method is a generalization of the method of Fourier which finds bounds on variables satisfying linear inequality constraints. First, nonlinear inequality constraints are converted to equivalent sets of separable constraints. Generalized variable elimination techniques are used to reduce these to constraints in one variable. Bounds on that variable are obtained and an inductive process yields bounds on the others.Research Sponsored by the Office of Naval Research Grant N00014-89-J-1537.  相似文献   

2.
Regulation of Overlaps in Technology Development Activities   总被引:6,自引:0,他引:6  
In this paper, we present an algorithm for the solution of multiparametric mixed integer linear programming (mp-MILP) problems involving (i) 0-1 integer variables, and, (ii) more than one parameter, bounded between lower and upper bounds, present on the right hand side (RHS) of constraints. The solution is approached by decomposing the mp-MILP into two subproblems and then iterating between them. The first subproblem is obtained by fixing integer variables, resulting in a multiparametric linear programming (mp-LP) problem, whereas the second subproblem is formulated as a mixed integer linear programming (MILP) problem by relaxing the parameters as variables.  相似文献   

3.
In this paper we consider the solution of a bi-level linear fractional programming problem (BLLFPP) by weighting method. A non-dominated solution set is obtained by this method. In this article decision makers (DMs) provide their preference bounds to the decision variables that is the upper and lower bounds to the decision variables they control. We convert the hierarchical system into scalar optimization problem (SOP) by finding proper weights using the analytic hierarchy process (AHP) so that objective functions of both levels can be combined into one objective function. Here the relative weights represent the relative importance of the objective functions.  相似文献   

4.
Discrete moment problems (DMP) with integer moments were first introduced by Prékopa to provide sharp lower and upper bounds for functions of discrete random variables. Prékopa also developed fast and stable dual type linear programming methods for the numerical solutions of the problem. In this paper, we assume that some fractional moments are also available and propose basic theory and a solution method for the bounding problems. Numerical experiments show significant improvement in the tightness of the bounds.  相似文献   

5.
This paper deals with two-stage and multi-stage stochastic programs in which the right-hand sides of the constraints are Gaussian random variables. Such problems are of interest since the use of Gaussian estimators of random variables is widespread. We introduce algorithms to find upper bounds on the optimal value of two-stage and multi-stage stochastic (minimization) programs with Gaussian right-hand sides. The upper bounds are obtained by solving deterministic mathematical programming problems with dimensions that do not depend on the sample space size. The algorithm for the two-stage problem involves the solution of a deterministic linear program and a simple semidefinite program. The algorithm for the multi-stage problem invovles the solution of a quadratically constrained convex programming problem.  相似文献   

6.
Weighted deviation problems are linear programs in which weights (or penalties) are attached to deviations from upper and lower bounds on particular linear expressions. In turn the deviations may be bracketed by secondary bounds. These problems include statistical problems of minimizing weighted sums of absolute deviations, standard and extended “goal programming” problems, problems with upper bounds on absolute values of linear affine functions, problems with arbitrarily bounded variables, and combinations of these.Previous specialized linear programming methods for related problems have been restricted to specialized cases that involve only a single basis configuration, or else, by means of “extended GUB” techniques, accommodate a diverse variety of basis structures at the cost of substantially increased computation. We show that, of the several basis configurations that can arise for this problem, precisely three are essential. Special rules are identified to allow transitions between these three structures, to yield valid compact versions of both the primal and the dual simplex methods. Finally, we show how these results lead to improved efficiency as well as reduced problem size.  相似文献   

7.
A specialization of the dual simplex method is developed for solving the linear programming (LP) knapsack problem subject to generalized upper bound (GUB) constraints. The LP/GUB knapsack problem is of interest both for solving more general LP problems by the dual simplex method, and for applying surrogate constraint strategies to the solution of 0–1 Multiple Choice integer programming problems. We provide computational bounds for our method of o(n logn), wheren is the total number of problem variables. These bounds reduce the previous best estimate of the order of complexity of the LP/GUB knapsack problem (due to Witzgall) and provide connections to computational bounds for the ordinary knapsack problem.We further provide a variant of our method which has only slightly inferior worst case bounds, yet which is ideally suited to solving integer multiple choice problems due to its ability to post-optimize while retaining variables otherwise weeded out by convex dominance criteria.  相似文献   

8.
This paper presents a new algorithm for integer programming with bounded variables which is efficient when m < n and when the upper bounds on the variables are small. The main idea is the application of the Balas and Jeroslow canonical hyperplanes and the systematic search of integer points over certain faces of the feasible region. During each iteration the integer points on a certain face are examined, and then this whole face is discarded from the feasible region of a linear programming problem. After a bounded number of iterations, the optimal integer solution is found, if one exists.  相似文献   

9.
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.  相似文献   

10.
A lexicographic minimax algorithm for multiperiod resource allocation   总被引:2,自引:0,他引:2  
Resource allocation problems are typically formulated as mathematical programs with some special structure that facilitates the development of efficient algorithms. We consider a multiperiod problem in which excess resources in one period can be used in subsequent periods. The objective minimizes lexicographically the nonincreasingly sorted vector of weighted deviations of cumulative activity levels from cumulative demands. To this end, we first develop a new minimax algorithm that minimizes the largest weighted deviation among all cumulative activity levels. The minimax algorithm handles resource constraints, ordering constraints, and lower and upper bounds. At each iteration, it fixes certain variables at their lower bounds, and sets groups of other variables equal to each other as long as no lower bounds are violated. The algorithm takes advantage of the problem's special structure; e.g., each term in the objective is a linear decreasing function of only one variable. This algorithm solves large problems very fast, orders of magnitude faster than well known linear programming packages. (The latter are, of course, not designed to solve such minimax problems efficiently.) The lexicographic procedure repeatedly employs the minimax algorithm described above to solve problems, each of the same format but with smaller dimension.  相似文献   

11.
This paper deals with the problem of profit optimization in sawn timber production, utilizing a special type of sawmill. Expected rejects and resetting costs are taken into consideration. The present problem is formulated as a fixed charge linear programming problem involving identical fixed charges, one equality constraint and explicit bounds on the variables. Based on the greedy sorting of the variables we develop a branch-and-bound algorithm working on a special subset of all solutions. Through usage of the problem structure for constructing bounds we arrive at an acceptable CPU-time (on a 80386 personal computer) for practical purposes.  相似文献   

12.
This paper presents a backward state reduction dynamic programming algorithm for generating the exact Pareto frontier for the bi-objective integer knapsack problem. The algorithm is developed addressing a reduced problem built after applying variable fixing techniques based on the core concept. First, an approximate core is obtained by eliminating dominated items. Second, the items included in the approximate core are subject to the reduction of the upper bounds by applying a set of weighted-sum functions associated with the efficient extreme solutions of the linear relaxation of the multi-objective integer knapsack problem. Third, the items are classified according to the values of their upper bounds; items with zero upper bounds can be eliminated. Finally, the remaining items are used to form a mixed network with different upper bounds. The numerical results obtained from different types of bi-objective instances show the effectiveness of the mixed network and associated dynamic programming algorithm.  相似文献   

13.
The problem of locating new facilities with respect to existing facilities is stated as a linear programming problem where inter-facility distances are assumed to be rectangular. The criterion of location is the minimization of the maximum weighted rectangular distance in the system. Linear constraints which (a) limit the new facility locations and (b) enforce upper bounds on the distances between new and existing facilities and between new facilities can be included. The dual programming problem is formulated in order to provide for an efficient solution procedure. It is shown that the duLal variables provide information abouLt the complete range of new facility locations which satisfy the minimax criterion.  相似文献   

14.
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.  相似文献   

15.
A new algorithmic approach for solving the stochastic Steiner tree problem based on three procedures for computing lower bounds (dual ascent, Lagrangian relaxation, Benders decomposition) is introduced. Our method is derived from a new integer linear programming formulation, which is shown to be strongest among all known formulations. The resulting method, which relies on an interplay of the dual information retrieved from the respective dual procedures, computes upper and lower bounds and combines them with several rules for fixing variables in order to decrease the size of problem instances. The effectiveness of our method is compared in an extensive computational study with the state-of-the-art exact approach, which employs a Benders decomposition based on two-stage branch-and-cut, and a genetic algorithm introduced during the DIMACS implementation challenge on Steiner trees. Our results indicate that the presented method significantly outperforms existing ones, both on benchmark instances from literature, as well as on large-scale telecommunication networks.  相似文献   

16.
We review the results of studying integer linear programming algorithms which exploit properties of problem relaxation sets. The main attention is paid to the estimation of the number of iterations of these algorithms by means of the regular partitions method and other approaches. We present such estimates for some cutting plane, branch and bound (Land and Doig scheme), and L-class enumeration algorithms and consider questions of their stability. We establish the upper bounds for the average number of iterations of the mentioned algorithms as applied to the knapsack problem and the set packing one.  相似文献   

17.
In this paper, we consider the following minimax linear programming problem: min z = max1 ≤ jn{CjXj}, subject to Ax = g, x ≥ 0. It is well known that this problem can be transformed into a linear program by introducing n additional constraints. We note that these additional constraints can be considered implicitly by treating them as parametric upper bounds. Based on this approach we develop two algorithms: a parametric algorithm and a primal—dual algorithm. The parametric algorithm solves a linear programming problem with parametric upper bounds and the primal—dual algorithm solves a sequence of related dual feasible linear programming problems. Computation results are also presented, which indicate that both the algorithms are substantially faster than the simplex algorithm applied to the enlarged linear programming problem.  相似文献   

18.
In this paper we consider the quadratic knapsack problem which consists in maximizing a positive quadratic pseudo-Boolean function subject to a linear capacity constraint. We propose a new method for computing an upper bound. This method is based on the solution of a continuous linear program constructed by adding to a classical linearization of the problem some constraints rebundant in 0–1 variables but nonredundant in continuous variables. The obtained upper bound is better than the bounds given by other known methods. We also propose an algorithm for computing a good feasible solution. This algorithm is an elaboration of the heuristic methods proposed by Chaillou, Hansen and Mahieu and by Gallo, Hammer and Simeone. The relative error between this feasible solution and the optimum solution is generally less than 1%. We show how these upper and lower bounds can be efficiently used to determine the values of some variables at the optimum. Finally we propose a branch-and-bound algorithm for solving the quadratic knapsack problem and report extensive computational tests.  相似文献   

19.
An interesting new partitioning and bounded variable algorithm (PBVA) is proposed for solving linear programming problems. The PBVA is a variant of the simplex algorithm which uses a modified form of the simplex method followed by the dual simplex method for bounded variables. In contrast to the two-phase method and the big M method, the PBVA does not introduce artificial variables. In the PBVA, a reduced linear program is formed by eliminating as many variables as there are equality constraints. A subproblem containing one ‘less than or equal to’ constraint is solved by executing the simplex method modified such that an upper bound is placed on an unbounded entering variable. The remaining constraints of the reduced problem are added to the optimal tableau of the subproblem to form an augmented tableau, which is solved by applying the dual simplex method for bounded variables. Lastly, the variables that were eliminated are restored by substitution. Differences between the PBVA and two other variants of the simplex method are identified. The PBVA is applied to solve an example problem with five decision variables, two equality constraints, and two inequality constraints. In addition, three other types of linear programming problems are solved to justify the advantages of the PBVA.  相似文献   

20.
This paper presents a special purpose linear programming algorithm to solve a least absolute value regression problem with upper and lower bounds on the parameters. The algorithm exploits the problem's special structure by maintaining a compact representation of the basis inverse and by allowing for the capability to combine several simplex iterations into one. Computational results with a computer code implementation of the algorithm are given.  相似文献   

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

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