首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 849 毫秒
1.
Limit and shakedown analysis problems of Computational Mechanics lead to convex optimization problems, characterized by linear objective functions, linear equality constraints and constraints expressing the restrictions imposed by the material strength. It is shown that two important strength criteria, the Mohr–Coulomb and the Tresca criterion, can be represented as systems of semidefinite constraints, leading this way to semidefinite programming problems.  相似文献   

2.
The weighted sums approach for linear and convex multiple criteria optimization is well studied. The weights determine a linear function of the criteria approximating a decision makers overall utility. Any efficient solution may be found in this way. This is not the case for multiple criteria integer programming. However, in this case one may apply the more general e-constraint approach, resulting in particular single-criteria integer programming problems to generate efficient solutions. We show how this approach implies a more general, composite utility function of the criteria yielding a unified treatment of multiple criteria optimization with and without integrality constraints. Moreover, any efficient solution can be found using appropriate composite functions. The functions may be generated by the classical solution methods such as cutting plane and branch and bound algorithms.  相似文献   

3.
This is a summary of the author’s PhD thesis supervised by A. Billionnet and S. Elloumi and defended on November 2006 at the CNAM, Paris (Conservatoire National des Arts et Métiers). The thesis is written in French and is available from http://www.cedric.cnam.fr/PUBLIS/RC1115. This work deals with exact solution methods based on reformulations for quadratic 0–1 programs under linear constraints. These problems are generally not convex; more precisely, the associated continuous relaxation is not a convex problem. We developed approaches with the aim of making the initial problem convex and of obtaining a good lower bound by continuous relaxation. The main contribution is a general method (called QCR) that we implemented and applied to classical combinatorial optimization problems.   相似文献   

4.
We consider a p-norm linear discrimination model that generalizes the model of Bennett and Mangasarian (1992) and reduces to a linear programming problem with p-order cone constraints. The proposed approach for handling linear programming problems with p-order cone constraints is based on reformulation of p-order cone optimization problems as second order cone programming (SOCP) problems when p is rational. Since such reformulations typically lead to SOCP problems with large numbers of second order cones, an “economical” representation that minimizes the number of second order cones is proposed. A case study illustrating the developed model on several popular data sets is conducted.  相似文献   

5.
This paper deals with the so-called total ill-posedness of linear optimization problems with an arbitrary (possibly infinite) number of constraints. We say that the nominal problem is totally ill-posed if it exhibits the highest unstability in the sense that arbitrarily small perturbations of the problem’s coefficients may provide both, consistent (with feasible solutions) and inconsistent problems, as well as bounded (with finite optimal value) and unbounded problems, and also solvable (with optimal solutions) and unsolvable problems. In this paper we provide sufficient conditions for the total ill-posedness property exclusively in terms of the coefficients of the nominal problem.  相似文献   

6.
The paper addresses an important but difficult class of concave cost supply management problems which consist in minimizing a separable increasing concave objective function subject to linear and disjunctive constraints. We first recast these problems into mixed zero-one nondifferentiable concave minimization over linear constraints problems and then apply exact penalty techniques to state equivalent nondifferentiable polyhedral DC (Difference of Convex functions) programs. A new deterministic approach based on DC programming and DCA (DC Algorithms) is investigated to solve the latter ones. Finally numerical simulations are reported which show the efficiency, the robustness and the globality of our approach.  相似文献   

7.
The paper considers solving of linear programming problems with p-order conic constraints that are related to a certain class of stochastic optimization models with risk objective or constraints. The proposed approach is based on construction of polyhedral approximations for p-order cones, and then invoking a Benders decomposition scheme that allows for efficient solving of the approximating problems. The conducted case study of portfolio optimization with p-order conic constraints demonstrates that the developed computational techniques compare favorably against a number of benchmark methods, including second-order conic programming methods.  相似文献   

8.
This paper deals with the stability of two families of linear optimization problems, each one formed by the dual problems to the members of the other family. We characterize the problems of these families that are stable in the sense that they remain consistent (inconsistent) under sufficiently small arbitrary perturbations of all the data. This characterization is established in terms of the lower semicontinuity property of the feasible set mapping and the boundedness of the optimal set of the corresponding coupled problem. Other continuity properties of the feasible set mapping are also derived. This stability theory extends some well-known theorems of Williams and Robinson on the stability of ordinary linear programming problems to linear optimization problems with infinitely many variables or constraints.  相似文献   

9.
New types of optimization problems are faced by the generating companies that operate on deregulated electricity markets. The characteristics of these problems depend on the various market structures. In the framework of the recently settled Italian electricity market, one of these new problems is the transition from hourly energy programs, defined by the market, to more detailed power generation dispatches, defined for intervals of 15 min. Such a more detailed plan is needed on the one hand by the national system operator (Terna, Rete Elettrica Nazionale) for the assessment of power system stability and security, and on the other hand by the power plant operators for its implementation. The transition procedure should respect the hourly energy constraints and take the main operating constraints of the generating units into account. The paper presents possible solutions of the problem through linear optimization models and reports computational results on real-world instances.   相似文献   

10.
In engineering plasticity, the behavior of a structure (e.g., a frame or truss) under a variety of loading conditions is studied. Two primary types of analysis are generally conducted. Limit analysis determines the rigid plastic collapse load for a structure and can be formulated as a linear program (LP). Deformation analysis at plastic collapse can be formulated as a quadratic program (QP). The constraints of the two optimization problems are closely related. This paper presents a specialization of the projection method for linear programming for the limit-load analysis problem. The algorithm takes advantage of the relationship between the LP constraints and QP constraints to provide advantageous starting data for the projection method applied to the QP problem. An important feature of the method is that it avoids problems of apparent infeasibility due to roundoff errors. Experimental results are given for two medium-sized problems.This work was supported by the National Research Council of Canada under Research Grant No. A8189.  相似文献   

11.
Stochastic dominance relations are well studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into stochastic optimization problems as constraints. In the discrete case, stochastic optimization models involving second order stochastic dominance constraints can be solved by linear programming. However, problems involving first order stochastic dominance constraints are potentially hard due to the non-convexity of the associated feasible regions. In this paper we consider a mixed 0–1 linear programming formulation of a discrete first order constrained optimization model and present a relaxation based on second order constraints. We derive some valid inequalities and restrictions by employing the probabilistic structure of the problem. We also generate cuts that are valid inequalities for the disjunctive relaxations arising from the underlying combinatorial structure of the problem by applying the lift-and-project procedure. We describe three heuristic algorithms to construct feasible solutions, based on conditional second order constraints, variable fixing, and conditional value at risk. Finally, we present numerical results for several instances of a real world portfolio optimization problem. This research was supported by the NSF awards DMS-0603728 and DMI-0354678.  相似文献   

12.
We propose a multidimensional filter SQP algorithm. The multidimensional filter technique proposed by Gould et al. [SIAM J. Optim., 2005] is extended to solve constrained optimization problems. In our proposed algorithm, the constraints are partitioned into several parts, and the entry of our filter consists of these different parts. Not only the criteria for accepting a trial step would be relaxed, but the individual behavior of each part of constraints is considered. One feature is that the undesirable link between the objective function and the constraint violation in the filter acceptance criteria disappears. The other is that feasibility restoration phases are unnecessary because a consistent quadratic programming subproblem is used. We prove that our algorithm is globally convergent to KKT points under the constant positive generators (CPG) condition which is weaker than the well-known Mangasarian-Fromovitz constraint qualification (MFCQ) and the constant positive linear dependence (CPLD). Numerical results are presented to show the efficiency of the algorithm.  相似文献   

13.
The subject of this paper is the formulation and discussion of a semi-infinite linear vector optimization problem which extends multiple objective linear programming problems to those with an infinite number of objective functions and constraints. Furthermore it generalizes in some way semi-infinite programming. Besides the statement of some immediately derived results which are related to known results in semi-infinite linear programming and vector optimization, the problem mentioned above is interpreted as a decision model, under risk or uncertainty containing continuous random variables. Thus we treat the case of an infinite number of occuring states of nature. These types of problems frequently occur within aspects of decision theory in management science.  相似文献   

14.
A conic integer program is an integer programming problem with conic constraints. Many problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic constraints. We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second-order conic sets. These cuts can be readily incorporated in branch-and-bound algorithms that solve either second-order conic programming or linear programming relaxations of conic integer programs at the nodes of the branch-and-bound tree. Central to our approach is a reformulation of the second-order conic constraints with polyhedral second-order conic constraints in a higher dimensional space. In this representation the cuts we develop are linear, even though they are nonlinear in the original space of variables. This feature leads to a computationally efficient implementation of nonlinear cuts for conic mixed-integer programming. The reformulation also allows the use of polyhedral methods for conic integer programming. We report computational results on solving unstructured second-order conic mixed-integer problems as well as mean–variance capital budgeting problems and least-squares estimation problems with binary inputs. Our computational experiments show that conic mixed-integer rounding cuts are very effective in reducing the integrality gap of continuous relaxations of conic mixed-integer programs and, hence, improving their solvability. This research has been supported, in part, by Grant # DMI0700203 from the National Science Foundation.  相似文献   

15.
In this paper some global optimality conditions for general quadratic {0, 1} programming problems with linear equality constraints are discussed and then some global optimality conditions for quadratic assignment problems (QAP) are presented. A local optimization method for (QAP) is derived according to the necessary global optimality conditions. A global optimization method for (QAP) is presented by combining the sufficient global optimality conditions, the local optimization method and some auxiliary functions. Some numerical examples are given to illustrate the efficiency of the given optimization methods.  相似文献   

16.
In this paper, we present an improved Partial Enumeration Algorithm for Integer Programming Problems by developing a special algorithm, named PE_SPEEDUP (partial enumeration speedup), to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to understand and implement, yet very effective in dealing with many integer programming problems, including knapsack problems, reliability optimization, and spare allocation problems. The algorithm is based on monotonicity properties of the problem functions, and uses function values only; it does not require continuity or differentiability of the problem functions. This allows its use on problems whose functions cannot be expressed in closed algebraic form. The reliability and efficiency of the proposed PE_SPEEDUP algorithm has been demonstrated on some integer optimization problems taken from the literature.  相似文献   

17.
Interior point methods for optimization have been around for more than 25 years now. Their presence has shaken up the field of optimization. Interior point methods for linear and (convex) quadratic programming display several features which make them particularly attractive for very large scale optimization. Among the most impressive of them are their low-degree polynomial worst-case complexity and an unrivalled ability to deliver optimal solutions in an almost constant number of iterations which depends very little, if at all, on the problem dimension. Interior point methods are competitive when dealing with small problems of dimensions below one million constraints and variables and are beyond competition when applied to large problems of dimensions going into millions of constraints and variables.In this survey we will discuss several issues related to interior point methods including the proof of the worst-case complexity result, the reasons for their amazingly fast practical convergence and the features responsible for their ability to solve very large problems. The ever-growing sizes of optimization problems impose new requirements on optimization methods and software. In the final part of this paper we will therefore address a redesign of interior point methods to allow them to work in a matrix-free regime and to make them well-suited to solving even larger problems.  相似文献   

18.
In this paper a linear programming-based optimization algorithm called the Sequential Cutting Plane algorithm is presented. The main features of the algorithm are described, convergence to a Karush–Kuhn–Tucker stationary point is proved and numerical experience on some well-known test sets is showed. The algorithm is based on an earlier version for convex inequality constrained problems, but here the algorithm is extended to general continuously differentiable nonlinear programming problems containing both nonlinear inequality and equality constraints. A comparison with some existing solvers shows that the algorithm is competitive with these solvers. Thus, this new method based on solving linear programming subproblems is a good alternative method for solving nonlinear programming problems efficiently. The algorithm has been used as a subsolver in a mixed integer nonlinear programming algorithm where the linear problems provide lower bounds on the optimal solutions of the nonlinear programming subproblems in the branch and bound tree for convex, inequality constrained problems.  相似文献   

19.
The travelling salesman problem, being one of the most attractive and well-studied combinatorial optimization problems, has many variants, one of which is called ‘travelling salesman problem with Time Windows (TSPTW)’. In this problem, each city (nodes, customers) must be visited within a time window defined by the earliest and the latest time. In TSPTW, the traveller has to wait at a city if he/she arrives early; thus waiting times directly affect the duration of a tour. It would be useful to develop a new model solvable by any optimizer directly. In this paper, we propose a new integer linear programming formulation having O(n2) binary variables and O(n2) constraints, where (n) equals the number of nodes of the underlying graph. The objective function is stated to minimize the total travel time plus the total waiting time. A computational comparison is made on a suite of test problems with 20 and 40 nodes. The performances of the proposed and existing formulations are analysed with respect to linear programming relaxations and the CPU times. The new formulation considerably outperforms the existing one with respect to both the performance criteria. Adaptation of our formulation to the multi-traveller case and some additional restrictions for special situations are illustrated.  相似文献   

20.
This paper presents a new relaxation technique to globally optimize mixed-integer polynomial programming problems that arise in many engineering and management contexts. Using a bilinear term as the basic building block, the underlying idea involves the discretization of one of the variables up to a chosen accuracy level (Teles, J.P., Castro, P.M., Matos, H.A. (2013). Multiparametric disaggregation technique for global optimization of polynomial programming problems. J. Glob. Optim. 55, 227–251), by means of a radix-based numeric representation system, coupled with a residual variable to effectively make its domain continuous. Binary variables are added to the formulation to choose the appropriate digit for each position together with new sets of continuous variables and constraints leading to the transformation of the original mixed-integer non-linear problem into a larger one of the mixed-integer linear programming type. The new underestimation approach can be made as tight as desired and is shown capable of providing considerably better lower bounds than a widely used global optimization solver for a specific class of design problems involving bilinear terms.  相似文献   

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

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