首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
The problem of finding a minimum cardinality set of nodes in a graph which meet every edge is of considerable theoretical as well as practical interest. Because of the difficulty of this problem, a linear relaxation of an integer programming model is sometimes used as a heuristic. In fact Nemhauser and Trotter showed that any variables which receive integer values in an optimal solution to the relaxation can retain the same values in an optimal solution to the integer program. We define 2-bicritical graphs and give several characterizations of them. One characterization is that they are precisely the graphs for which an optimal solution to the linear relaxation will have no integer valued variables. Then we show that almost all graphs are 2-bicritical and hence the linear relaxation almost never helps for large random graphs.This research was supported in part by the National Research Council of Canada.  相似文献   

2.
The airline crew scheduling problem is the problem of assigning crew itineraries to flights. We develop a new approach for solving the problem that is based on enumerating hundreds of millions random pairings. The linear programming relaxation is solved first and then millions of columns with best reduced cost are selected for the integer program. The number of columns is further reduced by a linear programming based heuristic. Finally an integer solution is obtained with a commercial integer programming solver. The branching rule of the solver is enhanced with a combination of strong branching and a specialized branching rule. The algorithm produces solutions that are significantly better than ones found by current practice.  相似文献   

3.
Commercial branch and bound codes for solving the general mixed integer linear programming problem commence by solving the linear programming relaxation of the submitted problem, terminating if the relaxation is unbounded. It is assumed that the submitted problem is either unbounded or has no feasible solutions. It is shown that the assumption is correct for all integer programming problems which can be submitted to the currently available codes (though counter examples which cannot be so submitted are given), but that the assumption is generally incorrect for discrete linear programming problems (using for example the special ordered set construct). Sufficient conditions on formulations to ensure its correctness are given. One possible formulation approach, applicable to special ordered set situations, is discussed.  相似文献   

4.
This paper describes a problem faced by the Public Transport Corporation (PTC) in the Australian State of Victoria. It involved the allocation of locomotives to the freight trains operated by the Corporation. Such a problem can be classified as a multi-class multi-locomotive problem since different types (or classes) of locomotive are available to pull the trains and some of the trains are heavy enough to require more than one locomotive. Because of the features of the services operated by the PTC, formulation of this problem as a pure integer program is straightforward, provided the objective function can be linearised. However, obtaining the optimal solution from this formulation is not. Large optimality gaps remained after various attempts to tighten the problem. Other authors have reported similar difficulties with similar problems. The original problem was therefore reformulated using special ordered covering sets of type 1. After reformulation, the optimal solution was obtained in less than a second of CPU time. This enabled alternative methods of linearising the objective function to be evaluated, resulting eventually in the decision to extend the concept of minimal covering sets so that each integer variable in the problem was expressed as a linear sum of a special ordered covering set of binary variables. In this way, the objective function was both exact and linear and the model, although much larger, still solved in under a second of CPU time. The methods of solution proposed in this paper should be capable of extension to more general resource allocation problems exhibiting similar features.  相似文献   

5.
This paper discusses heuristic branch and bound methods for solving mixed integer linear programming problems. The research presented on here is the follow on to that recorded in [3].After a resumé of the concept of pseudo-costs and estimations, new heuristic rules for generating a tree which make use of pseudo-costs and estimations are presented. Experiments have shown that models having a low percentage of integer variables behave in a radically different way from models with a high percentage of integer variables. The new heuristic rules seem to apply generally to the first type of model.Later, other heuristic rules are presented that are used with models having a high percentage of integer variables and with models having a special structure (models including special ordered sets.)The rules introduced here have been implemented in the IBM Mathematical Programming System Extended/370. They are used to solve large mixed integer linear programming models.Numerical results that permit comparisons to be made among the different rules are provided and discussed.  相似文献   

6.
The master problem in Benders's partitioning method is an integer program with a very large number of constraints, each of which is usually generated by solving the integer program with the constraints generated earlier. Computational experience shows that the subset B of those constraints of the master problem that are satisfied with equality at the linear programming optimum often play a crucial role in determining the integer optimum, in the sense that only a few of the remaining inequalities are needed. We characterize this subset B of inequalities. If an optimal basic solution to the linear program is nondegenerate in the continuous variables and has p integer-constrained basic variables, then the corresponding set B contains at most 2p inequalities, none of which is implied by the others. We give an efficient procedure for generating an appropriate subset of the inequalities in B, which leads to a considerably improved version of Benders's method.  相似文献   

7.
介绍了模糊数学和整数规划的背景、现状、以及发展趋势,并以模糊结构元理论定义了梯形模糊加权序,进一步证明了模糊整数规划模型的最优解等价于整数规划模型的最优解,再利用整数规划模型的最优解的求解方法求解模糊整数规划模型的最优解,最后,通过算例验证方法的可行性.  相似文献   

8.

The Nemhauser–Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: for every optimal LP solution that assigns integer values to some variables, there exists an optimal integer solution in which these variables retain the same values. While the standard LP is defined by only non-negativity and edge constraints, a variety of other LP formulations have been studied and one may wonder whether any of them has this property as well. We show that any other formulation that satisfies mild conditions cannot have the persistency property on all graphs, unless it is always equal to the stable set polytope.

  相似文献   

9.
We study here a problem of schedulingn job types onm parallel machines, when setups are required and the demands for the products are correlated random variables. We model this problem as a chance constrained integer program.Methods of solution currently available—in integer programming and stochastic programming—are not sufficient to solve this model exactly. We develop and introduce here a new approach, based on a geometric interpretation of some recent results in Gröbner basis theory, to provide a solution method applicable to a general class of chance constrained integer programming problems.Out algorithm is conceptually simple and easy to implement. Starting from a (possibly) infeasible solution, we move from one lattice point to another in a monotone manner regularly querying a membership oracle for feasibility until the optimal solution is found. We illustrate this methodology by solving a problem based on a real system.Corresponding author.  相似文献   

10.
We present branching-on-hyperplane methods for solving mixed integer linear and mixed integer convex programs. In particular, we formulate the problem of finding a good branching hyperplane using a novel concept of adjoint lattice. We also reformulate the problem of rounding a continuous solution to a mixed integer solution. A worst case complexity of a Lenstra-type algorithm is established using an approximate log-barrier center to obtain an ellipsoidal rounding of the feasible set. The results for the mixed integer convex programming also establish a complexity result for the mixed integer second order cone programming and mixed integer semidefinite programming feasibility problems as a special case. Our results motivate an alternative reformulation technique and a branching heuristic using a generalized (e.g., ellipsoidal) norm reduced basis available at the root node.  相似文献   

11.
This paper considers a multicast routing problem to find the minimum cost tree where the whole communication link delay on each path(route) of the tree is subject to a given delay allowance. The problem is formulated as an integer programming problem by using path variables. An associated problem reduction property is then characterised to reduce the solution space. Moreover, a polynomial time column generation procedure is exploited to solve the associated linear programming relaxation with such solution space reduced. Therefore a branch-and-price algorithm is derived to obtain the optimal integer solution(tree) for the problem. Computational results show that the algorithm can solve practical size problems in a reasonable length of time.  相似文献   

12.
An minimization problem with a linear objective function subject to fuzzy relation equations using max-product composition has been considered by Loetamonphong and Fang. They first reduced the problem by exploring the special structure of the problem and then proposed a branch-and-bound method to solve this 0-1 integer programming problem. In this paper, we provide a necessary condition for an optimal solution of the minimization problems in terms of one maximum solution derived from the fuzzy relation equations. This necessary condition enables us to derive efficient procedures for solving such optimization problems. Numerical examples are provided to illustrate our procedures.  相似文献   

13.
The optimal pump control problem in a water supply system can be formulated as a mixed integer programming problem. In general, this problem is very difficult to solve by conventional integer programming algorithms, because the number of decision variables is as large as the total number of combinations of pump stations and control periods. However, it possesses a certain block triangular structure, which offers an attractive computational scheme. Taking advantage of this structure, this paper proposes a heuristic decomposition algorithm for finding a good feasible solution to this type of mixed integer programming problems. Numerical results for an actual pump control problem are also reported.  相似文献   

14.
We present cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which is to minimally perturb the objective function of a mixed integer linear program in order to make a given feasible solution optimal.  相似文献   

15.
In this paper, discrete mathematical programming approaches are used to solve the frequency allocation and cell site selection problem in an integrated setup. Both CDMA (code division multiple access) and FD/TDMA (frequency/time division multiple access) technologies will be important for 3rd generation mobile systems. If all users share the same bandwidth, base transmitter stations should be placed such that a maximum of traffic can be carried at low interference rates. The expected traffic is represented by spatially scattered weighted nodes. The problem to select an optimal set of base station locations from a given pool of configurations is formulated as an integer linear program and solved by combinatorial optimization methods. For systems which employ FD/TDMA schemes, the cell site optimization process depends on the assignment of channels. We suggest an integrated linear programming approach to solve both objectives in a single planning step. Because of the problems' tremendous complexity, special branch-and-bound procedures are developed as exact and approximate solution methods. An examples is given for a typical urban scenario with base transmitters below roof tops.  相似文献   

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

17.
Branch and cut methods for integer programming problems solve a sequence of linear programming problems. Traditionally, these linear programming relaxations have been solved using the simplex method. The reduced costs available at the optimal solution to a relaxation may make it possible to fix variables at zero or one. If the solution to a relaxation is fractional, additional constraints can be generated which cut off the solution to the relaxation, but donot cut off any feasible integer points. Gomory cutting planes and other classes of cutting planes are generated from the final tableau. In this paper, we consider using an interior point method to solve the linear programming relaxations. We show that it is still possible to generate Gomory cuts and other cuts without having to recreate a tableau, and we also show how variables can be fixed without using the optimal reduced costs. The procedures we develop do not require that the current relaxation be solved to optimality; this is useful for an interior point method because early termination of the current relaxation results in an improved starting point for the next relaxation.  相似文献   

18.
The zero-one integer programming problem and its special case, the multiconstraint knapsack problem frequently appear as subproblems in many combinatorial optimization problems. We present several methods for computing lower bounds on the optimal solution of the zero-one integer programming problem. They include Lagrangean, surrogate and composite relaxations. New heuristic procedures are suggested for determining good surrogate multipliers. Based on theoretical results and extensive computational testing, it is shown that for zero-one integer problems with few constraints surrogate relaxation is a viable alternative to the commonly used Lagrangean and linear programming relaxations. These results are used in a follow up paper to develop an efficient branch and bound algorithm for solving zero-one integer programming problems.  相似文献   

19.
Computer programs to solve linear programming problems by the simplex method have existed since the early 1950s. They remain the central feature of today's mathematical programming systems. There has been a steady increase in the size of problem that can be solved: this has been due as much to a better understanding of how to exploit sparseness as to larger and faster computers. There has been a steady increase in the type of problem that can be solved: this has been due as much to new concepts, such as separable programming, integer variables and special ordered sets, as to new algorithms. There has been a steady increase in the extent to which the application of mathematical programming has become more automatic. This applies both to the use of computerized matrix generators and report writers and to the mathematical formulation itself, in that we rely less on the user producing a well-scaled linear programming problem and are starting on the process of automatically sharpening the formulation of integer programming problems.Important new work is being done on all these aspects of computational mathematical programming.  相似文献   

20.
Special ordered sets (SOS) have been introduced as a practical device for efficiently handling special classes of nonconvex optimization problems. They are now implemented in most commercial codes for mathematical programming (MP software). The paper gives a survey of possible applications as multiple choice restrictions, conditional multiple choice restrictions, discrete variables, discontinuous variables and piecewise linear functions, global optimization of separable programming problems, alternative right-hand sides, overlapping special ordered sets and the solution of quadratic programming problems. Alternative problem formulations are discussed. Since special ordered sets are not defined uniquely modelling facilities depend on the definition of a special orderedset in a code. The paper demonstrates the superiority of SOS to the application of binary variables if they are treated judiciously.  相似文献   

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

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