共查询到20条相似文献,搜索用时 140 毫秒
1.
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. 相似文献
2.
Computational Discretization Algorithms for Functional Inequality Constrained Optimization 总被引:6,自引:0,他引:6
In this paper, a functional inequality constrained optimization problem is studied using a discretization method and an adaptive scheme. The problem is discretized by partitioning the interval of the independent parameter. Two methods are investigated as to how to treat the discretized optimization problem. The discretization problem is firstly converted into an optimization problem with a single nonsmooth equality constraint. Since the obtained equality constraint is nonsmooth and does not satisfy the usual constraint qualification condition, relaxation and smoothing techniques are used to approximate the equality constraint via a smooth inequality constraint. This leads to a sequence of approximate smooth optimization problems with one constraint. An adaptive scheme is incorporated into the method to facilitate the computation of the sum in the inequality constraint. The second method is to apply an adaptive scheme directly to the discretization problem. Thus a sequence of optimization problems with a small number of inequality constraints are obtained. Convergence analysis for both methods is established. Numerical examples show that each of the two proposed methods has its own advantages and disadvantages over the other. 相似文献
3.
In this paper we first establish a Lagrange multiplier condition characterizing a regularized Lagrangian duality for quadratic
minimization problems with finitely many linear equality and quadratic inequality constraints, where the linear constraints
are not relaxed in the regularized Lagrangian dual. In particular, in the case of a quadratic optimization problem with a
single quadratic inequality constraint such as the linearly constrained trust-region problems, we show that the Slater constraint
qualification (SCQ) is necessary and sufficient for the regularized Lagrangian duality in the sense that the regularized duality
holds for each quadratic objective function over the constraints if and only if (SCQ) holds. A new theorem of the alternative
for systems involving both equality constraints and two quadratic inequality constraints plays a key role. We also provide
classes of quadratic programs, including a class of CDT-subproblems with linear equality constraints, where (SCQ) ensures
regularized Lagrangian duality. 相似文献
4.
《Journal of computational science》2013,4(5):360-369
This paper deals with one equality constraint in fuzzy environment and other inequality constraint with both fuzzy and random parameter together. The purpose of this paper is to demonstrate the application of these type of constraints in a production inventory model solved as a Bang–Bang control problem in a finite time horizon. Finally numerical experiments have been performed for illustration. 相似文献
5.
将0-1离散规划通过一个非线性等式约束表示为[0,1]区间上等价的连续变量非线性规划列式.对非线性等式约束的问题进行了两种方法的处理.第一种方法使用乘子法,第二种方法将非线性的等式约束近似为一个非线性的不等式约束,均利用遗传算法程序GENOCOP进行了求解.对多个算例进行了计算,结果表明了该方法的可行性和有效性. 相似文献
6.
Maziar Salahi 《Central European Journal of Operations Research》2010,18(2):181-187
In this paper, first we show that for rank deficient matrices, the optimal solution of a single equality constrained quadratic
minimization problem can be found by relaxing the equality constraint to the inequality one, which makes the problem a convex
problem. Then we show that for full rank matrices, an optimal solution can be obtained using semidefinite optimization framework. 相似文献
7.
In this note we present an approach based on formulation space search to solve mixed-integer nonlinear (zero-one) programming problems. Our approach is an iterative one which adds a single nonlinear inequality constraint of increasing tightness to the original problem. Computational results are presented for our approach on 51 standard benchmark problems taken from MINLPLib. We compare our approach against the Minotaur and minlp_bb nonlinear solvers, as well as against the RECIPE algorithms. 相似文献
8.
Given a mixed-integer programming problem with two matrix constraints, it is possible to define a Lagrangean relaxation such
that the relaxed problem decomposes additively into two subproblems, each having one of the two matrices of the original problem
as its constraints. There is one Lagrangean multiplier per variable. We prove that the optimal value of this new Lagrangean
dual dominates the optimal value of the Lagrangean dual obtained by relaxing one set of constraints and give a necessary condition
for a strict improvement. We show on an example that the resulting bound improvement can be substantial. We show on a complex
practical problem how Lagrangean decomposition may help uncover hidden special structures and thus yield better solution methodology.
Research supported by the National Science Foundation under grant ECS-8508142. 相似文献
9.
Kalpana Dahiya Surjeet Kaur Suneja Vanita Verma 《Computational Optimization and Applications》2007,36(1):67-82
In this paper a minimization problem with convex objective function subject to a separable convex inequality constraint “≤”
and bounded variables (box constraints) is considered. We propose an iterative algorithm for solving this problem based on
line search and convergence of this algorithm is proved. At each iteration, a separable convex programming problem with the
same constraint set is solved using Karush-Kuhn-Tucker conditions. Convex minimization problems subject to linear equality/
linear inequality “≥” constraint and bounds on the variables are also considered. Numerical illustration is included in support
of theory. 相似文献
10.
Takeshi Tsuchiya 《Journal of Global Optimization》2012,54(4):831-854
In this paper, we propose a new deterministic global optimization method for solving nonlinear optimal control problems in which the constraint conditions of differential equations and the performance index are expressed as polynomials of the state and control functions. The nonlinear optimal control problem is transformed into a relaxed optimal control problem with linear constraint conditions of differential equations, a linear performance index, and a matrix inequality condition with semidefinite programming relaxation. In the process of introducing the relaxed optimal control problem, we discuss the duality theory of optimal control problems, polynomial expression of the approximated value function, and sum-of-squares representation of a non-negative polynomial. By solving the relaxed optimal control problem, we can obtain the approximated global optimal solutions of the control and state functions based on the degree of relaxation. Finally, the proposed global optimization method is explained, and its efficacy is proved using an example of its application. 相似文献
11.
M. Golestani H. Sadeghi Y. Tavan 《Journal of Optimization Theory and Applications》2018,179(3):896-916
In this paper, a multiobjective problem with a feasible set defined by inequality, equality and set constraints is considered, where the objective and constraint functions are locally Lipschitz. Here, a generalized Stampacchia vector variational inequality is formulated as a tool to characterize quasi- or weak quasi-efficient points. By using two new classes of generalized convexity functions, under suitable constraint qualifications, the equivalence between Kuhn–Tucker vector critical points, solutions to the multiobjective problem and solutions to the generalized Stampacchia vector variational inequality in both weak and strong forms will be proved. 相似文献
12.
李杨 《纯粹数学与应用数学》2020,(1):80-93
研究了与渐近非扩张半群不动点问题相关的分裂等式混合均衡问题.在等式约束下,为同时逼近两个空间中混合均衡问题和渐近非扩张半群不动点问题的公共解,借助收缩投影方法引出了一种迭代程序.在适当条件下,该迭代算法的强收敛性被证明.文末还把所得结果应用于分裂等式混合变分不等式问题和分裂等式凸极小化问题. 相似文献
13.
In this paper we consider a nonsmooth optimization problem with equality, inequality and set constraints. We propose new constraint qualifications and Kuhn–Tucker type necessary optimality conditions for this problem involving locally Lipschitz functions. The main tool of our approach is the notion of convexificators. We introduce a nonsmooth version of the Mangasarian–Fromovitz constraint qualification and show that this constraint qualification is necessary and sufficient for the Kuhn–Tucker multipliers set to be nonempty and bounded. 相似文献
14.
Bin Li Chang Jun Yu Kok Lay Teo Guang Ren Duan 《Journal of Optimization Theory and Applications》2011,151(2):260-291
In this paper, we consider a class of optimal control problems subject to equality terminal state constraints and continuous
state and control inequality constraints. By using the control parametrization technique and a time scaling transformation,
the constrained optimal control problem is approximated by a sequence of optimal parameter selection problems with equality
terminal state constraints and continuous state inequality constraints. Each of these constrained optimal parameter selection
problems can be regarded as an optimization problem subject to equality constraints and continuous inequality constraints.
On this basis, an exact penalty function method is used to devise a computational method to solve these optimization problems
with equality constraints and continuous inequality constraints. The main idea is to augment the exact penalty function constructed
from the equality constraints and continuous inequality constraints to the objective function, forming a new one. This gives
rise to a sequence of unconstrained optimization problems. It is shown that, for sufficiently large penalty parameter value,
any local minimizer of the unconstrained optimization problem is a local minimizer of the optimization problem with equality
constraints and continuous inequality constraints. The convergent properties of the optimal parameter selection problems with
equality constraints and continuous inequality constraints to the original optimal control problem are also discussed. For
illustration, three examples are solved showing the effectiveness and applicability of the approach proposed. 相似文献
15.
We consider the problem of minimizing a function over a region defined by an arbitrary set, equality constraints, and constraints of the inequality type defined via a convex cone. Under some moderate convexity assumptions on the arbitrary set we develop Optimality criteria of the minimum principle type which generalize the Fritz John Optimality conditions. As a consequence of this result necessary Optimality criteria of the saddle point type drop out. Here convexity requirements on the functions are relaxed to convexity at the point under investigation. We then present the weakest possible constraint qualification which insures positivity of the lagrangian multiplier corresponding to the objective function. 相似文献
16.
17.
In this paper, we present a new relaxation method for mathematical programs with complementarity constraints. Based on the fact that a variational inequality problem defined on a simplex can be represented by a finite number of inequalities, we use an expansive simplex instead of the nonnegative orthant involved in the complementarity constraints. We then remove some inequalities and obtain a standard nonlinear program. We show that the linear independence constraint qualification or the Mangasarian–Fromovitz constraint qualification holds for the relaxed problem under some mild conditions. We consider also a limiting behavior of the relaxed problem. We prove that any accumulation point of stationary points of the relaxed problems is a weakly stationary point of the original problem and that, if the function involved in the complementarity constraints does not vanish at this point, it is C-stationary. We obtain also some sufficient conditions of B-stationarity for a feasible point of the original problem. In particular, some conditions described by the eigenvalues of the Hessian matrices of the Lagrangian functions of the relaxed problems are new and can be verified easily. Our limited numerical experience indicates that the proposed approach is promising. 相似文献
18.
D.O Norris 《Journal of Mathematical Analysis and Applications》1973,43(1):261-272
Necessary conditions for the minimization of a differentiable function subject to differentiable equality and inequality constraints are given. These conditions are applied to a control problem with a state-variable inequality constraint. The connection with earlier work of Neustadt and Jacobson, Lele, and Speyer is given. 相似文献
19.
This paper considers optimal control problems involving the minimization of a functional subject to differential constraints, terminal constraints, and a state inequality constraint. The state inequality constraint is of a special type, namely, it is linear in some or all of the components of the state vector.A transformation technique is introduced, by means of which the inequality-constrained problem is converted into an equality-constrained problem involving differential constraints, terminal constraints, and a control equality constraint. The transformation technique takes advantage of the partial linearity of the state inequality constraint so as to yield a transformed problem characterized by a new state vector of minimal size. This concept is important computationally, in that the computer time per iteration increases with the square of the dimension of the state vector.In order to illustrate the advantages of the new transformation technique, several numerical examples are solved by means of the sequential gradient-restoration algorithm for optimal control problems involving nondifferential constraints. The examples show the substantial savings in computer time for convergence, which are associated with the new transformation technique.This research was supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-76-3075, and by the National Science Foundation, Grant No. MCS-76-21657. 相似文献
20.
We examine augmented Lagrangians for optimization problems with a single (either inequality or equality) constraint. We establish some links between augmented Lagrangians and Lagrange-type functions and propose a new kind of Lagrange-type functions for a problem with a single inequality constraint. Finally, we discuss a supergradient algorithm for calculating optimal values of dual problems corresponding to some class of augmented Lagrangians. 相似文献