共查询到20条相似文献,搜索用时 31 毫秒
1.
Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raises this issue as to whether the two approaches can be combined in a declarative modeling framework. This paper proposes a general declarative modeling system in which the conditional structure of the constraints shows how to integrate any “checker” and any special-purpose “solver”. In particular this integrates constraint programming and optimization methods, because the checker can consist of constraint propagation methods, and the solver can be a linear or nonlinear programming routine. 相似文献
2.
Moussa Maïga Nacim Ramdani Louise Travé-Massuyès Christophe Combastel 《Mathematics in Computer Science》2014,8(3-4):407-423
Computing the reachable set of hybrid dynamical systems in a reliable and verified way is an important step when addressing verification or synthesis tasks. This issue is still challenging for uncertain nonlinear hybrid dynamical systems. We show in this paper how to combine a method for computing continuous transitions via interval Taylor methods and a method for computing the geometrical intersection of a flowpipe with guard sets, to build an interval method for reachability computation that can be used with truly nonlinear hybrid systems. Our method for flowpipe guard set intersection has two variants. The first one relies on interval constraint propagation for solving a constraint satisfaction problem and applies in the general case. The second one computes the intersection of a zonotope and a hyperplane and applies only when the guard sets are linear. The performance of our method is illustrated on examples involving typical hybrid systems. 相似文献
3.
Miguel A. Goberna Mercedes Larriqueta Virginia N. Vera de Serio 《Journal of Computational and Applied Mathematics》2008
Many mathematical programming models arising in practice present a block structure in their constraint systems. Consequently, the feasibility of these problems depends on whether the intersection of the solution sets of each of those blocks is empty or not. The existence theorems allow to decide when the intersection of non-empty sets in the Euclidean space, which are the solution sets of systems of (possibly infinite) inequalities, is empty or not. In those situations where the data (i.e., the constraints) can be affected by some kind of perturbations, the problem consists of determining whether the relative position of the sets is preserved by sufficiently small perturbations or not. This paper focuses on the stability of the non-empty (empty) intersection of the solutions of some given systems, which can be seen as the images of set-valued mappings. We give sufficient conditions for the stability, and necessary ones as well; in particular we consider (semi-infinite) convex systems and also linear systems. In this last case we discuss the distance to ill-posedness. 相似文献
4.
Fred Glover 《Journal of Heuristics》2003,9(3):175-227
Surrogate constraint methods have been embedded in a variety of mathematical programming applications over the past thirty years, yet their potential uses and underlying principles remain incompletely understood by a large segment of the optimization community. In a number of significant domains of combinatorial optimization, researchers have produced solution strategies without recognizing that they can be derived as special instances of surrogate constraint methods. Once the connection to surrogate constraint ideas is exposed, additional ways to exploit this framework become visible, frequently offering opportunities for improvement.We provide a tutorial on surrogate constraint approaches for optimization in graphs, illustrating the key ideas by reference to independent set and graph coloring problems, including constructions for weighted independent sets which have applications to associated covering and weighted maximum clique problems. In these settings, the surrogate constraints can be generated relative to well-known packing and covering formulations that are convenient for exposing key notions. The surrogate constraint approaches yield widely used heuristics for identifying independent sets as simple special cases, and also afford previously unidentified heuristics that have greater power in these settings. Our tutorial also shows how the use of surrogate constraints can be placed within the context of vocabulary building strategies for independent set and coloring problems, providing a framework for applying surrogate constraints that can be used in other applications.At a higher level, we show how to make use of surrogate constraint information, together with specialized algorithms for solving associated sub-problems, to obtain stronger objective function bounds and improved choice rules for heuristic or exact methods. The theorems that support these developments yield further strategies for exploiting surrogate constraint relaxations, both in graph optimization and integer programming generally. 相似文献
5.
We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that combines constraint programming and linear programming. FCNF problems test the hybrid approach on problems that are already rather well suited for a classical 0–1 model. They are solved by means of a global constraint that generates specialized constraint propagation algorithms and a projected relaxation that can be rapidly solved as a minimum cost network flow problem. The hybrid approach ran about twice as fast as a commercial mixed integer programming code on fixed charge transportation problems with its advantage increasing with problem size. For general fixed charge transshipment problems, however, it has no effect because the implemented propagation methods are weak. 相似文献
6.
Analytical Linear Inequality Systems and Optimization 总被引:1,自引:0,他引:1
Goberna M. A. Jornet V. Puente R. Todorov M. I. 《Journal of Optimization Theory and Applications》1999,103(1):95-119
In many interesting semi-infinite programming problems, all the constraints are linear inequalities whose coefficients are analytical functions of a one-dimensional parameter. This paper shows that significant geometrical information on the feasible set of these problems can be obtained directly from the given coefficient functions. One of these geometrical properties gives rise to a general purification scheme for linear semi-infinite programs equipped with so-called analytical constraint systems. It is also shown that the solution sets of such kind of consistent systems form a transition class between polyhedral convex sets and closed convex sets in the Euclidean space of the unknowns. 相似文献
7.
Certain types of necessary optimality conditions for mathematical programming problems are equivalent to corresponding regularity conditions on the constraint set. For any problem, a certain natural optimality condition, dependent upon the particular constraint set, is always satisfied. This condition can be strengthened in numerous ways by invoking appropriate regularity assumptions on the constraint set. Results are presented for Euclidean spaces and some extensions to Banach spaces are given.This work was supported in part by the Office of Naval Research, Contract No. N00014-67-A-0321-0003 (NR-047-095). 相似文献
8.
Improved Generalization via Tolerant Training 总被引:2,自引:0,他引:2
Theoretical and computational justification is given for improved generalization when the training set is learned with less accuracy. The model used for this investigation is a simple linear one. It is shown that learning a training set with a tolerance improves generalization, over zero-tolerance training, for any testing set satisfying a certain closeness condition to the training set. These results, obtained via a mathematical programming formulation, are placed in the context of some well-known machine learning results. Computational confirmation of improved generalization is given for linear systems (including nine of the twelve real-world data sets tested), as well as for nonlinear systems such as neural networks for which no theoretical results are available at present. In particular, the tolerant training method improves generalization on noisy, sparse, and overparameterized problems. 相似文献
9.
10.
白国仲 《数学的实践与认识》2008,38(21)
基于可持续发展和保护资源、环境的特殊需要,提出了三个新的运输问题.它们的数学模型都是含有不可微约束的双目标规划问题.还给出了求解这些问题的简便方法. 相似文献
11.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
12.
N. S. Papageorgiou 《Periodica Mathematica Hungarica》1992,25(2):133-152
In this paper we examine the dependence of the solutions and optimal solutions of a class of linear, infinite dimensional control systems on the control constraint set. This is done using the weak and the Kuratowski-Mosco convergence of sets. First we establish some general facts about weakly convergent multifunctions. Then we prove some convergence theorems for the trajectories of certain control systems. We also derive a general relaxation theorem. Subsequently we pass to optimal control problems and prove various convergence results. We conclude with an example from parabolic control systems.Research supported by N. S. F. Grant DMS-8802688 相似文献
13.
Arne Stolbjerg Drud 《Mathematical Programming》1997,79(1-3):99-123
Modeling systems are very important for bringing mathematical programming software to nonexpert users, but few nonlinear programming
algorithms are today linked to a modeling system. The paper discussed the advantages of linking modeling systems with nonlinear
programming. Traditional algorithms can be linked using black-box function and derivatives evaluation routines for local optimization.
Methods for generating this information are discussed. More sophisticated algorithms can get access to almost any type of
information: interval evaluations and constraint restructuring for detailed preprocessing, second order information for sequential
quadratic programming and interior point methods, and monotonicity and convex relaxations for global optimization. Some of
the sophisticated information is available today; the rest can be generated on demand. 相似文献
14.
《Optimization》2012,61(1):15-28
This paper contains investigations of qualitative properties of a class of linear parametric programming problems with several parameters in the constraint matrix, where the dependence on the parameters is characterized by a matrix of rank 1, For such problems the set of feasible parameters and local stability sets are represented explicitly, their geometrical and topological properties and properties of the optimal set and of the supremum function on these sets are investigated. 相似文献
15.
Milan Hladík 《Fuzzy Optimization and Decision Making》2009,8(3):283-294
We deal with the linear programming problem in which input data can vary in some given real compact intervals. The aim is
to compute the exact range of the optimal value function. We present a general approach to the situation the feasible set
is described by an arbitrary linear interval system. Moreover, certain dependencies between the constraint matrix coefficients
can be involved. As long as we are able to characterize the primal and dual solution set (the set of all possible primal and
dual feasible solutions, respectively), the bounds of the objective function result from two nonlinear programming problems.
We demonstrate our approach on various cases of the interval linear programming problem (with and without dependencies). 相似文献
16.
《European Journal of Operational Research》1986,27(1):50-56
Nonlinear integer programming problems with bounded feasible sets are considered. It is shown how the number of constraints in such problems can be reduced with the aid of an exact penalty function approach. This approach can be used to construct an equivalent unconstrained problem, or a problem with a constraint set which makes it easier to solve. The application of this approach to various nonlinear integer programming problems is discussed. 相似文献
17.
Simge Kü?ükyavuz 《Mathematical Programming》2012,132(1-2):31-56
The mixing set with a knapsack constraint arises in deterministic equivalent of chance-constrained programming problems with finite discrete distributions. We first consider the case that the chance-constrained program has equal probabilities for each scenario. We study the resulting mixing set with a cardinality constraint and propose facet-defining inequalities that subsume known explicit inequalities for this set. We extend these inequalities to obtain valid inequalities for the mixing set with a knapsack constraint. In addition, we propose a compact extended reformulation (with polynomial number of variables and constraints) that characterizes a linear programming equivalent of a single chance constraint with equal scenario probabilities. We introduce a blending procedure to find valid inequalities for intersection of multiple mixing sets. We propose a polynomial-size extended formulation for the intersection of multiple mixing sets with a knapsack constraint that is stronger than the original mixing formulation. We also give a compact extended linear program for the intersection of multiple mixing sets and a cardinality constraint for a special case. We illustrate the effectiveness of the proposed inequalities in our computational experiments with probabilistic lot-sizing problems. 相似文献
18.
Steffen Borchers Sandro Bosio Rolf Findeisen Utz-Uwe Haus Philipp Rumschinski Robert Weismantel 《Mathematical Methods of Operations Research》2011,73(3):381-400
This paper focuses on combinatorial feasibility and optimization problems that arise in the context of parameter identification
of discrete dynamical systems. Given a candidate parametric model for a physical system and a set of experimental observations,
the objective of parameter identification is to provide estimates of the parameter values for which the model can reproduce
the experiments. To this end, we define a finite graph corresponding to the model, to each arc of which a set of parameters
is associated. Paths in this graph are regarded as feasible only if the sets of parameters corresponding to the arcs of the
path have nonempty intersection. We study feasibility and optimization problems on such feasible paths, focusing on computational
complexity. We show that, under certain restrictions on the sets of parameters, some of the problems become tractable, whereas
others are NP-hard. In a similar vein, we define and study some graph problems for experimental design, whose goal is to support
the scientist in optimally designing new experiments. 相似文献
19.
Error bounds in mathematical programming 总被引:22,自引:0,他引:22
Jong-Shi Pang 《Mathematical Programming》1997,79(1-3):299-332
Originated from the practical implementation and numerical considerations of iterative methods for solving mathematical programs,
the study of error bounds has grown and proliferated in many interesting areas within mathematical programming. This paper
gives a comprehensive, state-of-the-art survey of the extensive theory and rich applications of error bounds for inequality
and optimization systems and solution sets of equilibrium problems.
This work is based on research supported by the U.S. National Science Foundation under grant CCR-9624018. 相似文献
20.
Chemical Engineering design and analysis is dominated by the use of modular computational systems restricting the use of rigorous
global optimisation techniques. Other engineering domains also exploit modularity in order to break down complex tasks to
allow the use of legacy codes, to protect intellectual property, and to allow large teams to work on problems. By casting
modules in a generic form such systems could be recast to incorporate interval based methods. In this paper we explore the
use of five interval contraction methods to improve the performance of interval based optimization of modular process design
systems: consistency methods, constraint propagation, Interval Gaussian elimination, Interval Newton and Linear Programming.
It is shown that the Linear Programming contractor provides the greatest value in contracting the intervals and that constraint
propagation and Interval Gaussian elimination (as implemented here) provides less of an impact. Other contractors do provide
value and the LP contractor will be of less value as the problem size increases so it is necessary to include a number of
contractors which can be done at small computational cost. A number of challenges are outlined which need to be addressed
before there can be routine use of interval global optimization in modular systems. 相似文献