首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
J. A. González  N. Nabona 《TOP》1994,2(1):59-84
Summary The long-term hydrothermal coordination of electricity generation has to optimize many variables tied to stochastic parameters. Multicommodity network flows in a replicated reservoir hydronetwork with multicommodity water inflows is one of the possible ways to model and optimize the long-term coordination. In the existing literature on this methodology there are several hypotheses and simplifications that need validation and analysis, and this is the prime purpose of this work. Simulation tests show that the method is sound, and indicate ways to improve the algorithm. The advantages and limitations of taking more or less water commodities are also analyzed.  相似文献   

2.
F. J. Heredia  N. Nabona 《TOP》1994,2(1):105-132
Summary Optimizing the thermal production of electricity in the short term in an integrated power system when a thermal unit commitment has been decided means coordinating hydro and thermal generation in order to obtain the minimum thermal generation costs over the time period under study. Fundamental constraints to be satisfied are the covering of each hourly load and satisfaction of spinning reserve requirements. A nonlinear network flow model with linear side constraints with no decomposition into hydro and thermal subproblems was used to solve the hydrothermal scheduling. Hydrogeneration is linearized with respect to network variables and a novel thermal generation network is introduced. Computational results are reported.  相似文献   

3.
The growth of containerization and transporting goods in containers has created many problems for ports. In this paper, we systematically survey a literature over problems in container terminals. The operations that take place in container terminals are described and then the problems are classified into five scheduling decisions. For each of the decisions, an overview of the literature is presented. After that, each of the decisions is formulated as Constraint Satisfaction and Optimization Problems (CSOPs). The literature also includes simulations and performance in container terminals. To evaluate any solution methods to the decisions and to measure its efficiency, several indicators are suggested.  相似文献   

4.
We consider the problem of minimizing f(y)dm with y dm=c,c fixed. The functionf is assumed to be continuous, but need not be convex. For this problem, we give necessary and sufficient conditions for the existence of solutions. We also give conditions under which uniqueness in a certain sense holds, and we show a relation which holds between the minimizers of two different problems and the corresponding values of the constraintsc.This research was supported by FINEP-Brazil, Grant Nos. 62.24-0416-00 and 4.2.82.0719-00.  相似文献   

5.
This paper is concerned with the constrained optimization problem. A detailed discussion of surrogate constraints with zero duality gaps is presented. Readily available surrogate multipliers are considered that close the duality gaps where constraints are rational-valued. Through illustrative examples, the sources of duality gaps are examined in detail. While in the published literature, in many situations conclusions have been made about the existence of non-zero duality gaps, we show that taking advantage of full problem information can close the duality gaps. Overlooking such information can produce shortcomings in the research in which a non-zero duality gap is observed. We propose theorems to address the shortcomings and report results regarding implementation issues.  相似文献   

6.
In an optimization problem with equality constraints we define an accessory function that is similar but different from a normal penalty function. In the accessory function we demonstrate the need to use small values of the parameter associated with an equality constraint. Large values of the parameter create extraneous stationary points which destroy the global convergence properties of steepest descent methods. By using small values of the parameters in the accessory function, when the current point is far away from the solution and when the constraint violations are large we are led to a refined version of the established SUMT method.  相似文献   

7.
Mathematical model and optimization in production investment   总被引:4,自引:0,他引:4  
We study a kind of nonlinear programming models derived from various investment problems, like industrial production investment, educational investment, farming investment, etc. We will analyze the properties of solutions of the models and obtain a polynomial algorithm. We will also apply our theory to a concrete example to demonstrate the algorithm complexity.  相似文献   

8.
We survey the main results presented by the author in his PhD thesis, supervised by F. Malucelli, and defended on the 15th March 2003. The thesis is written in English and is available on the Web page http: //www.elet.polimi.it/upload/belotti/thesis.pdf.gz. We investigate three problems, arising in the field of Telecommunication, of networks design with survivability constraints, and solve them through different approaches on a number of real-world network topologies with up to 40 nodes.Received: April 2004MSC classification: 90B10, 90C57  相似文献   

9.
10.
《Optimization》2012,61(3-4):239-259
In this paper we propose a new class of continuously differentiable globally exact penalty functions for the solution of minimization problems with simple bounds on some (all) of the variables. The penalty functions in this class fully exploit the structure of the problem and are easily computable. Furthermore we introduce a simple updating rule for the penalty parameter that can be used in conjunction with unconstrained minimization techniques to solve the original problem.  相似文献   

11.
This paper presents a secant method, based on R. B. Wilson's formula for the solution of optimization problems with inequality constraints. Global convergence properties are ensured by grafting the secant method onto a phase I - phase II feasible directions method, using a rate of convergence test for crossover control.This research was sponsored by the National Science Foundation, Grant No. ENG-73-08214 and Grant No. (RANN)-ENV-76-04264, and by the Joint Services Electronics Program. Contract No. F44620-76-C-0100.  相似文献   

12.
GenCos need the day-ahead unit commitment solutions in deregulated markets which are feasible, applicable in practice and consistent with the long-term planning decisions. However, such decisions are both vast in scope and different in nature so that applying a monolithic approach is subject to some difficulties and shortcomings. This paper aims to coordinate the long-term decision process with the day-ahead market scheduling through developing a profit-based fuzzy hierarchical bi-level approach. First, an annual planning model with monthly periods at power plant-generation technology level; then based upon a monthly scheduling with daily periods at generating unit level. An interactive solution method involving the soft coordination and feedback mechanisms using rolling horizon strategy is also presented. In the developed models, we try to address critical aspects of power system optimization. This approach is implemented for a real case and analytical results are reported.  相似文献   

13.
In recent years transportation agencies have introduced patrol based response programs to remove roadway incidents rapidly. With the evolution of technology incident detection and notification from remote traffic operation centers is possible and patrols to detect incidents are not necessary. Instead, the response units can be placed at various depots in urban areas and dispatched to incident sites upon notification. In this paper, we propose a reliability based mixed integer programming model to find best locations of incidence response depots and assign response vehicles to these depots so that incidents can be cleared efficiently at a minimum cost. The approach is unique as it considers fixed and variable costs of vehicles and depots, occurrences of major and minor incidents, and reliability of response service in the same model. Numerical results are generated for an example problem and sensitivity analysis is conducted to explore the relationships between parameters of the problem.  相似文献   

14.
This paper deals with a general class of evolution problems for semilinear equations coupled with nonlinear constraints. Those constraints may contain compositions of nonlinear operators and unbounded linear operators, and hence the associated operators are not necessarily formulated in the form of continuous perturbations of linear operators. Accordingly, a family of equivalent norms is introduced to discuss 'quasidissipativity' in a local sense of the operators and a generation theory for nonlinear semigroups is employed to construct solution operators on bounded sets. It is a feature of our treatment that the resultant solution operators are obtained as nonlinear semigroups on the whole space which are not 'quasicontractive' but locally equi-Lipschitz continuous.  相似文献   

15.
In this paper we consider the problem of scheduling n independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the makespan. Each machine is not continuously available at all times and each job can only be processed on specified machines. A network flow approach is used to formulate this scheduling problem into a series of maximum flow problems. We propose a polynomial time binary search algorithm to either verify the infeasibility of the problem or solve it optimally if a feasible schedule exists.  相似文献   

16.
This paper considers a class of multi-period flexible supply policies with options and capacity constraints. The main results are to characterize the optimal ordering and purchasing options policy and the minimum expected cost in a period and thereafter under the assumptions about the options and ordering quantities.  相似文献   

17.
The makespan minimization problem in flow shops with no-idle constraints on machines is considered. The latter means that each machine, once started, must process all its operations without intermediate idle time until all those operations are completed. The problem is known to be strongly NP-hard already for three machines. While being based on a geometrical approach, we propose several polynomial time heuristics (for the general case and for special cases of 3 and 4 machines) which provide asymptotically optimal solutions for the increasing number of jobs. A comprehensive review of relevant results is also presented.  相似文献   

18.
In this paper, a (weak) vector equilibrium principle for vector network problems with capacity constraints and elastic demands is introduced. A sufficient condition for a (weak) vector equilibrium flow to be a solution for a system of (weak) vector quasi-variational inequalities is obtained. By virtue of Gerstewitz’s nonconvex separation functional ξ, a (weak) ξ-equilibrium flow is introduced. Relations between a weak vector equilibrium flow and a (weak) ξ-equilibrium flow is investigated. Relations between weak vector equilibrium flows and two classes of variational inequalities are also studied.  相似文献   

19.
This paper considers a multi-product newsboy system that produces multiple products for fulfilling independently uncertain demands, which share the same production capacity. To deal with possible shortage of limited capacity, productions can be outsourced. We consider two outsourcing strategies: zero lead time outsourcing, and nonzero lead time outsourcing. The structural properties and solution procedures for the profit-maximization models are developed. Numerical results are provided for obtaining some managerial insights.  相似文献   

20.
We study a single machine scheduling problem with availability constraints and sequence-dependent setup costs, with the aim of minimizing the makespan. To the authors’ knowledge, this problem has not been treated as such in the operations research literature. We derive in this paper a mixed integer programming model to deal with such scheduling problem. Computational tests showed that commercial solvers are capable of solving only small instances of the problem. Therefore, we propose two ways for reducing the execution time, namely a valid inequality that strengthen the linear relaxation and an efficient heuristic procedure that provides a starting feasible solution to the solver. A substantial gain is achieved both in terms of the linear programming relaxation bound and in terms of the time to obtain an integer optimum when we use the enhanced model in conjunction with providing to the solver the solution obtained by the proposed heuristic.  相似文献   

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

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