Heat pump can be used to recover abundant thermal energy contained in the discharge of municipal wastewater treatment plants. While there are some design standards for common heat pump systems, the design of a sewage ...
详细信息
Heat pump can be used to recover abundant thermal energy contained in the discharge of municipal wastewater treatment plants. While there are some design standards for common heat pump systems, the design of a sewage source heat pump (SSHP) system is still often based on a fixed heat load and neglects the interdependencies between the equipment sizing and operating parameters. To address the issue that previous design methods have not balanced investment and operational costs well from a global optimisation perspective, this work formulates the simultaneous optimisation of SSHP design and operation as a non-linear programming problem. The proposed model features the consideration of multiple working conditions caused by the impact of ambient temperature variation on the heat load of the SSHP system. The feasibility and potential benefits of the optimised SSHP system are also evaluated by incorporating techno-economic performances and environmental impact analyses into the mathematical framework. A case study is carried out to demonstrate the effectiveness of the proposed methodology. The results show that the total annual cost of the optimally designed and operated SSHP in Harbin could be 9% lower than in Beijing and 39% lower than in Shanghai, suggesting that constructing and running the SSHP system in severe cold regions with great heating demands might be more economical than in less cold regions. The CO2, SO2, and NOx emissions of the SSHP could be approximately 50% less than that of coal-fired boiler heating, and 80% less than that of direct electric heating with coal-fired electricity. [GRAPHICS] .
In this paper an integer, non-linear mathematical programming model is developed to allocate emergency medical service (EMS) ambulances to sectors within a county in order to meet a government-mandated response-time c...
详细信息
In this paper an integer, non-linear mathematical programming model is developed to allocate emergency medical service (EMS) ambulances to sectors within a county in order to meet a government-mandated response-time criterion. However, in addition to the response-time criterion, the model also reflects criteria for budget and work-load, and, since ambulance response is best described within the context of a queueing system, several of the model system constraints are based on queueing formulations adapted to a mathematical programming format. The model is developed and demonstrated within the context of an example of a county encompassing rural, urban and mixed sectors which exhibit different demand and geographic characteristics. The example model is solved using an integer, non-linear goal-programming technique. The solution results provide ambulance allocations to sectors within the county, the probability of an ambulance exceeding a prespecified response time, and the utilization factor for ambulances per sector.
Automotive companies have a stable supply chain due to extensive vehicle production and global supply networks. The purpose of sustainable supply chain intelligence in this study is to minimize system costs and enviro...
详细信息
This paper builds on the work of Bessem Samet by introducing new results in the context of (v, w)-convex functions, both in general and for differentiable cases. The study extends the definition of (v, w)-convex funct...
详细信息
This paper builds on the work of Bessem Samet by introducing new results in the context of (v, w)-convex functions, both in general and for differentiable cases. The study extends the definition of (v, w)-convex functions from Euclidean space to Riemannian manifolds, leading to the concept of geodesic (v, w)-convex functions. Several theorems are proven, including results that show the preservation of (v, w)-convexity under summation and positive scalar multiplication of functions. Additionally, the paper presents novel findings on (v, w)-convexity in Riemannian manifolds, providing a theoretical foundation for future exploration. The developed theorems are also applied to nonlinearprogramming, offering a method to find optimal solutions for differentiable functions within this framework. This research contributes to both the theory of convexity and its applications in optimization problems on Riemannian manifolds.
One of the classic foundational constructs of Location Science was proposed by Alfred Weber in 1909. His construct involved finding the location for a single production facility which minimized the sum of weighted dis...
详细信息
One of the classic foundational constructs of Location Science was proposed by Alfred Weber in 1909. His construct involved finding the location for a single production facility which minimized the sum of weighted distances of transporting the needed raw materials from localized sources along with the sum of weighted distances in delivering the final product to one or more markets. The first objective of this paper is to review the major advancements in this simple classic single facility location problem and its variations. One can find in the literature a very large number of algorithms to solve the standard Weber problem. Some are iterative and others are finite even for geometric Euclidean and rectilinear spaces. Moreover, some schemes are efficient (theoretically) and others are practically quite fast. The second goal of this paper is to show that many extensions of the standard Weber problem can be solved by solving a polynomial number of standard Weber problems. This unifying result implies, in particular, that all these extensions are polynomially solvable since the standard Weber problem can be solved in polynomial time. In addition, with this unifying approach we solve some important planar non-convex Euclidean location problems in polynomial time.
Demand and supply pattern for most products varies during their life cycle in the markets. In this paper, the author presents a transportation problem with non-linear constraints in which supply and demand are symmetr...
详细信息
Demand and supply pattern for most products varies during their life cycle in the markets. In this paper, the author presents a transportation problem with non-linear constraints in which supply and demand are symmetric trapezoidal fuzzy value. In order to reflect a more realistic pattern, the unit of transportation cost is assumed to be stochastic. Then, the non-linear constraints are linearized by adding auxiliary constraints. Finally, the optimal solution of the problem is found by solving the linearprogramming problem with fuzzy and crisp constraints and by applying fuzzy programming technique. A new method proposed to solve this problem, and is illustrated through numerical examples. Multi-objective goal programming methodology is applied to solve this problem. The results of this research were developed and used as one of the Decision Support System models in the Logistics Department of Kayson Co.
In most engineering applications, solutions derived from the lower-bound theorem of plastic limit analysis are particularly valuable because they provide a safe estimate of the load that will cause plastic collapse. A...
详细信息
In most engineering applications, solutions derived from the lower-bound theorem of plastic limit analysis are particularly valuable because they provide a safe estimate of the load that will cause plastic collapse. A solution procedure based on the meshless local Petrov-Galerkin (MLPG) method is proposed for lower-bound limit analysis. This is the first work for lower-bound limit analysis by this meshless local weak form method. In the construction of trial functions, the natural neighbour interpolation (NNI) is employed to simplify the treatment of the essential boundary conditions. The discretized limit analysis problem is solved numerically with the reduced-basis technique. The self-equilibrium stress field is constructed by a linear combination of several self-equilibrium stress basis vectors, which can be computed by performing an equilibrium iteration procedure during elasto-plastic incremental analysis. The non-linear programming sub-problems are solved directly by the Complex method and the limit load multiplier converges monotonically to the lower-bound of real solution. Several numerical examples are given to verify the accuracy and reliability of the proposed method for lower-bound limit analysis.
Short-term hydrothermal scheduling issue is usually hard to tackle on account of its highly non-convex and non-differentiable characteristics. A popular strategy for handling these difficulties is to reformulate the i...
详细信息
Short-term hydrothermal scheduling issue is usually hard to tackle on account of its highly non-convex and non-differentiable characteristics. A popular strategy for handling these difficulties is to reformulate the issue by various linearization techniques. However, in this process, a fairly large number of continuous/binary variables and constraints will be introduced, which may result in a heavy computational burden. In this study, a logarithmic size mixed-integer linearprogramming formulation is presented for this issue, that is, only a logarithmic size of binary variables and constraints will be required to piecewise linearize the nonlinear functions. Based on such a formulation, a global optimum is therefore can be solved efficiently. To remove the linearization errors and cope with the network loss, a derivable nonlinearprogramming formulation is derived. By optimizing this formulation via the powerful interior point method, where the previous global solution of mixed-integer linearprogramming formulation is used as the starting point, a promising feasible solution is consequently attained. Numerical results show that the presented logarithmic size mixed-integer linearprogramming formulation is more efficient than the generalized one and when it is incorporated into the solution procedure, the proposed methodology is competitive with currently state-of-the-art approaches. (C) 2019 Elsevier Ltd. All rights reserved.
In this paper, we give a new penalized semidefinite programming approach for non-convex quadratically-constrained quadratic programs (QCQPs). We incorporate penalty terms into the objective of convex relaxations in or...
详细信息
In this paper, we give a new penalized semidefinite programming approach for non-convex quadratically-constrained quadratic programs (QCQPs). We incorporate penalty terms into the objective of convex relaxations in order to retrieve feasible and near-optimal solutions for non-convex QCQPs. We introduce a generalized linear independence constraint qualification (GLICQ) criterion and prove that any GLICQ regular point that is sufficiently close to the feasible set can be used to construct an appropriate penalty term and recover a feasible solution. Inspired by these results, we develop a heuristic sequential procedure that preserves feasibility and aims to improve the objective value at each iteration. Numerical experiments on large-scale system identification problems as well as benchmark instances from the library of quadratic programming demonstrate the ability of the proposed penalized semidefinite programs in finding near-optimal solutions for non-convex QCQP.
For mathematical programming (MP) to have greater impact as a decision tool, MP software systems must offer suitable support in terms of model communication and modelling techniques. In this paper, modelling technique...
详细信息
For mathematical programming (MP) to have greater impact as a decision tool, MP software systems must offer suitable support in terms of model communication and modelling techniques. In this paper, modelling techniques that allow logical restrictions to be modelled in integer programming terms are described, and their implications discussed. In addition, it is illustrated that many classes of non-linearities which are not variable separable may be, after suitable algebraic manipulation, put in a variable separable form. The methods of reformulating the fuzzy linearprogramming problem as a max-min problem is also introduced. It is shown that analysis of bounds plays a key role in the following four important contexts: model reduction, reformulation of logical restrictions as 0-1 mixed integer programmes, reformulation of non-linear programmes as variable separable programmes and reformulation of fuzzy linear programmes. It is observed that, as well as incorporating an interface between the modeller and the optimizer, there is a need to make available to the modeller software facilities which support the model reformulation techniques described here.
暂无评论