共查询到20条相似文献,搜索用时 640 毫秒
1.
We show that an undiscounted stochastic game possesses optimal stationary strategies if and only if a global minimum with objective value zero can be found to an appropriate nonlinear program with linear constraints. This nonlinear program arises as a method for solving a certain bilinear system, satisfaction of which is also equivalent to finding a stationary optimal solution for the game. The objective function of the program is a nonnegatively valued quadric polynomial.This research was supported in part by the National Science Foundation under the grant #ECS-8503440. We wish to thank the referee for many helpful comments and in streamlining the presentation. 相似文献
2.
3.
B. S. Goh 《Journal of Optimization Theory and Applications》2011,148(3):505-527
In an optimization problem with equality constraints the optimal value function divides the state space into two parts. At
a point where the objective function is less than the optimal value, a good iteration must increase the value of the objective function. Thus, a good iteration must be a balance between increasing or decreasing the objective
function and decreasing a constraint violation function. This implies that at a point where the constraint violation function
is large, we should construct noninferior solutions relative to points in a local search region. By definition, an accessory
function is a linear combination of the objective function and a constraint violation function. We show that a way to construct
an acceptable iteration, at a point where the constraint violation function is large, is to minimize an accessory function.
We develop a two-phases method. In Phase I some constraints may not be approximately satisfied or the current point is not
close to the solution. Iterations are generated by minimizing an accessory function. Once all the constraints are approximately
satisfied, the initial values of the Lagrange multipliers are defined. A test with a merit function is used to determine whether
or not the current point and the Lagrange multipliers are both close to the optimal solution. If not, Phase I is continued.
If otherwise, Phase II is activated and the Newton method is used to compute the optimal solution and fast convergence is
achieved. 相似文献
4.
We consider quadratic programs with pure general integer variables. The objective function is quadratic and convex and the constraints are linear. An exact solution approach is proposed. It is decomposed into two phases. In the first phase, the initial problem is reformulated into an equivalent problem with a separable objective function. This is done by use of a Gauss decomposition of the Hessian matrix of the initial problem and requires the addition of some continuous variables and constraints. In the second phase, the reformulated problem is linearized by an approximation of each squared term by a set of K linear functions that correspond to the tangents of a hyperbola in K points. We give a proof of the intuitive property that when K is large enough, the optimal value of the obtained linear program is very close to optimal value of the two previous problems, the initial problem and the reformulated separable problem. The reminder is dedicated to the implementation of a branch-and-bound algorithm for the solution of linearized problem, and its application to a set of instances. Several points are considered among which choice of the right value for parameter K and the implementation of a sophisticated heuristic solution algorithm. The numerical comparison is done with CPLEX 12.2 since, in this case, the initial problem as well as the problem reformulated by the first step can be solved by CPLEX. We show that with our approach, the total CPU time is divided by a factor ranging from 1.2 to 131.6 for instances with 40–60 variables. 相似文献
5.
The optimal impulsive control of systems arising from linear compartment models for drug distribution in the human body is considered. A system of linear, time-invariant, homogeneous differential equations is given along with a set of continuous constraints on state and control. The object is to develop a constructive algorithm for the computation of the optimal control relative to a convex cost functional. Under suitable hypotheses, satisfying the continuous constraints is equivalent to satisfying the constraints at a finite set of abstractly definedcritical points. Once these critical points have been determined, the solution of the optimal control problem is found as the solution of an ordinary finite-dimensional convex programming problem. An iterative algorithm is given for the situation in which the critical points cannot all be determineda priori.This work was supported in part by the National Science Foundation under Grant No. MPS-74-13332. 相似文献
6.
This paper considers the problem of optimizing a continuous nonlinear objective function subject to linear constraints via a piecewise-linear approximation. A systematic approach is proposed, which uses a lattice piecewise-linear model to approximate the nonlinear objective function on a simplicial partition and determines an approximately globally optimal solution by solving a set of standard linear programs. The new approach is applicable to any continuous objective function rather than to separable ones only and could be useful to treat more complex nonlinear problems. A numerical example is given to illustrate the practicability. 相似文献
7.
8.
《European Journal of Operational Research》2005,162(3):786-791
The paper gives a new approach towards a two––item inventory model for deteriorating items with a linear stock––dependent demand rate. In fact, for the first time, the interacting terms showing the mutual increase in the demand of one commodity due to the presence of the other is accommodated in the model. Again, from the linear demand rate, it follows that more is the inventory, more is the demand. So a control parameter is introduced, such that it maintains the continuous supply to the inventory. Next an objective function is formed to calculate the net profit with respect to all possible profits and all possible loss (taken with negative sign). The paper obtains a necessary criterion for the steady state optimal control problem for optimizing the objective function subjected to the constraints given by the ordinary differential equations of the inventory. It also considers a particular choice of parameters satisfying the above necessary conditions. Under this choice, the optimal values of control parameters are calculated; also the optimal amount of inventories is found out. Finally, with respect to these optimal values of control parameters and those of the optimal inventories, the optimal value of the objective function is determined.Next another choice of parameters is considered for which the aforesaid necessary conditions do not hold. Obviously, in that case the steady state solution is non-optimal. In such a case a suboptimal problem is considered corresponding to the more profitable inventory. It is shown that such suboptimal steady state solution fails to exist in this case. 相似文献
9.
Summary We present a general modeling framework for therobust optimization of linear network problems with uncertainty in the values of the right-hand side. In contrast to traditional approaches in
mathematical programming, we use scenarios to characterize the uncertainty. Solutions are obtained for each scenario and these
individual scenarios are aggregated to yield a nonanticipative or implementable policy that minimizes the regret of wrong
decisions. A given solution is termed robust if it minimizes the sum over the scenarios of the weighted upper difference between
the objective function value for the solution and the objective function value for the optimal solution for each scenario,
while satisfying certain nonanticipativity constraints. This approach results in a huge model with a network submodel per
scenario plus coupling constraints.
Several decomposition approaches are considered, namely Dantzig-Wolfe decomposition, various types of Benders decomposition
and different quadratic network approaches for approximating Augmented Lagrangian decomposition. We present computational
results for these methods, including two implementation versions of the Lagrangian based method: a sequential implementation
and a parallel implementation on a network of three workstations. 相似文献
10.
Etienne Chevalier M’hamed Gaïgi Vathana Ly Vath Mohamed Mnif 《Journal of Optimization Theory and Applications》2017,173(1):313-335
We consider a market dealer acting as a liquidity provider by continuously setting bid and ask prices for an illiquid asset in a quote-driven market. The market dealer may benefit from the bid–ask spread, but has the obligation to permanently quote both prices while satisfying some liquidity and inventory constraints. The objective is to maximize the expected utility from terminal liquidation value over a finite horizon and subject to the above constraints. We characterize the value function as the unique viscosity solution to the associated Hamilton–Jacobi–Bellman equation, and further enrich our study with numerical results. The contributions of our study concern both the modelling aspects and the dynamic structure of the control strategies. Important features and constraints characterizing market making problems are no longer ignored. 相似文献
11.
Interactive approaches employing cone contraction for multi-criteria mixed integer optimization are introduced. In each iteration, the decision maker (DM) is asked to give a reference point (new aspiration levels). The subsequent Pareto optimal point is the reference point projected on the set of admissible objective vectors using a suitable scalarizing function. Thereby, the procedures solve a sequence of optimization problems with integer variables. In such a process, the DM provides additional preference information via pair-wise comparisons of Pareto optimal points identified. Using such preference information and assuming a quasiconcave and non-decreasing value function of the DM we restrict the set of admissible objective vectors by excluding subsets, which cannot improve over the solutions already found. The procedures terminate if all Pareto optimal solutions have been either generated or excluded. In this case, the best Pareto point found is an optimal solution. Such convergence is expected in the special case of pure integer optimization; indeed, numerical simulation tests with multi-criteria facility location models and knapsack problems indicate reasonably fast convergence, in particular, under a linear value function. We also propose a procedure to test whether or not a solution is a supported Pareto point (optimal under some linear value function). 相似文献
12.
Optimal impulsive control of systems arising from linear compartment models for drug distribution in the human body is considered. A system of linear, time-invariant, homogeneous differential equations is given along with a set of continuous constraints on state and control. The object is to develop a constructive algorithm for the computation of the optimal control relative to a convex cost functional. It is first shown that under suitable hypotheses, satisfying the continuous constraints is equivalent to satisfying the constraints at a finite set of abstractly definedcritical points. Once these critical points have been determined, the solution of the optimal control problem is found as the solution of a finite-dimensional convex programming problem. The set of critical points can often be determineda priori solely from the qualitative behavior of the solutions of the system. A class of such problems, generalizing the so-calledplateau effect, is considered in detail. It is shown that the solution achieving the plateau effect is indeed optimal in certain cases. In a subsequent paper, an iterative algorithm will be given for the solution of these problems when the critical points cannot all be determineda priori.This work was supported in part by the National Science Foundation under Grant No. GP-20130. 相似文献
13.
Finding an efficient solution to linear bilevel programming problem: An effective approach 总被引:1,自引:0,他引:1
Multilevel programming is developed to solve the decentralized problem in which decision makers (DMs) are often arranged within a hierarchical administrative structure. The linear bilevel programming (BLP) problem, i.e., a special case of multilevel programming problems with a two level structure, is a set of nested linear optimization problems over polyhedral set of constraints. Two DMs are located at the different hierarchical levels, both controlling one set of decision variables independently, with different and perhaps conflicting objective functions. One of the interesting features of the linear BLP problem is that its solution may not be Paretooptimal. There may exist a feasible solution where one or both levels may increase their objective values without decreasing the objective value of any level. The result from such a system may be economically inadmissible. If the decision makers of the two levels are willing to find an efficient compromise solution, we propose a solution procedure which can generate effcient solutions, without finding the optimal solution in advance. When the near-optimal solution of the BLP problem is used as the reference point for finding the efficient solution, the result can be easily found during the decision process. 相似文献
14.
Rui Shen Zhiqing Meng Chuangyin Dang Min Jiang 《Numerical Functional Analysis & Optimization》2017,38(11):1473-1489
In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm. 相似文献
15.
The concept of ɛ-approximate optimal solution as widely used in nonconvex global optimization is not quite adequate, because
such a point may correspond to an objective function value far from the true optimal value, while being infeasible. We introduce
a concept of essential ɛ-optimal solution, which gives a more appropriate approximate optimal solution, while being stable
under small perturbations of the constraints. A general method for finding an essential ɛ-optimal solution in finitely many
steps is proposed which can be applied to d.c. programming and monotonic optimization. 相似文献
16.
A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite)
quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard
problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way
as a subproblem in quadratic programming with linear constraints. To get rid of the (sign) constraints, we propose a quartic
reformulation of StQPs, which is a special case (degree four) of a homogeneous program over the unit sphere. It turns out
that while KKT points are not exactly corresponding to each other, there is a one-to-one correspondence between feasible points
of the StQP satisfying second-order necessary optimality conditions, to the counterparts in the quartic homogeneous formulation.
We supplement this study by showing how exact penalty approaches can be used for finding local solutions satisfying second-order
necessary optimality conditions to the quartic problem: we show that the level sets of the penalty function are bounded for
a finite value of the penalty parameter which can be fixed in advance, thus establishing exact equivalence of the constrained
quartic problem with the unconstrained penalized version. 相似文献
17.
Manuel Morán 《Mathematische Nachrichten》2001,229(1):129-160
We analyze the multifractal spectrumof multiplicative set functions on a self-similar set with open set condition. We show that the multifractal components carry self-similar measures which maximize the dimension. This gives the dimension of a multifractal component as the solution of a problem of maximization of a quasiconcave function satisfying a set of linear constraints. Our analysis covers the case of multifractal components of self-similar measures, the case of Besicovitch normal sets of points, the multifractal spectrum of the relative logarithmic density of a pair of self-similar measures, the multifractal spectrum of the Liapunov exponent of the shift mapping and the intersections of all these sets. We show that the dimension of an arbitrary union of multifractal components is the supremum of the dimensions of the multifractal components in the union. The multidimensional Legendre transform is introduced to obtain the dimension of the intersection of finitely many multifractal components. 相似文献
18.
In this paper, we address linear bilevel programs when the coefficients of both objective functions are interval numbers. The focus is on the optimal value range problem which consists of computing the best and worst optimal objective function values and determining the settings of the interval coefficients which provide these values. We prove by examples that, in general, there is no precise way of systematizing the specific values of the interval coefficients that can be used to compute the best and worst possible optimal solutions. Taking into account the properties of linear bilevel problems, we prove that these two optimal solutions occur at extreme points of the polyhedron defined by the common constraints. Moreover, we develop two algorithms based on ranking extreme points that allow us to compute them as well as determining settings of the interval coefficients which provide the optimal value range. 相似文献
19.
To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more importantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs. 相似文献
20.
The rigorous and efficient determination of the global solution of a nonconvex MINLP problem arising from product portfolio
optimization introduced by Kallrath (2003) is addressed. The objective of the optimization problem is to determine the optimal
number and capacity of reactors satisfying the demand and leading to a minimal total cost. Based on the model developed by
Kallrath (2003), an improved formulation is proposed, which consists of a concave objective function and linear constraints
with binary and continuous variables. A variety of techniques are developed to tighten the model and accelerate the convergence
to the optimal solution. A customized branch and bound approach that exploits the special mathematical structure is proposed
to solve the model to global optimality. Computational results for two case studies are presented. In both case studies, the
global solutions are obtained and proved optimal very efficiently in contrast to available commercial MINLP solvers. 相似文献