Search results for "optimization"
showing 10 items of 2824 documents
An optimality test for semi-infinite linear programming
1992
In this paper we present a test to characterize the optimal solutions for the continuous semi-infinite linear programming problem. This optimality characterization is a condition of Kuhn–Tucker type. The resolution of a linear program permits to check the optimality of a feasible point,to detect the unboundedness of the problem and to find descent directions. We give some illustrative examples. We show that the local Mangasarian–Fromovitz constraint qualification is almost equivalent to Slater qualification for this problem. Furthermore, it follows from our study that this optimality condition is always necessary for a wide class of semi-infinite linear programming problems
Exact and Approximate Algorithms for Two–Criteria Topological Design Problem of WAN with Budget and Delay Constraints
2004
This paper studies the problem of designing wide area networks (WAN). In the paper the two-criteria topology assignment problem with two constraints is considered. The goal is select flow routes, channel capacities and network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to the budget constraint and delay constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also the approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results
2003
The problem is concerned with designing of wide area networks (WAN). The problem consists in selection of flow routes, channel capacities and wide area network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to delay constraint. The problem is NP complete. Then, the branch and bound method is used to construct the exact algorithm. Lower bound of the criterion function is proposed. Computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
New Geometric Constraint Solving Formulation: Application to the 3D Pentahedron
2014
Geometric Constraint Solving Problems (GCSP) are nowadays routinely investigated in geometric modeling. The 3D Pentahedron problem is a GCSP defined by the lengths of its edges and the planarity of its quadrilateral faces, yielding to an under-constrained system of twelve equations in eighteen unknowns. In this work, we focus on solving the 3D Pentahedron problem in a more robust and efficient way, through a new formulation that reduces the underlying algebraic formulation to a well-constrained system of three equations in three unknowns, and avoids at the same time the use of placement rules that resolve the under-constrained original formulation. We show that geometric constraints can be …
Solution isolation strategies for the Bernstein polytopes-based solver
2013
The Bernstein polytopes-based solver is a new method developed to solve systems of nonlinear equations, which often occur in Geometric Constraint Solving Problems. The principle of this solver is to linearize nonlinear monomials and then to solve the resulting linear programming problems, through linear programming. However, without any strategy for the isolation of the many solutions of multiple-solution systems, this solver is slow in practice. To overcome this problem, we propose in this work, a study of several strategies for solution isolation, through the split of solution boxes into several subboxes, according to three main steps answering the questions: when, where, and how to perfo…
Dynamic factorial graphical models for dynamic networks
2014
Dynamic networks models describe a growing number of important scientific processes, from cell biology and epidemiology to sociology and finance. Estimating dynamic networks from noisy time series data is a difficult task since the number of components involved in the system is very large. As a result, the number of parameters to be estimated is typically larger than the number of observations. However, a characteristic of many real life networks is that they are sparse. For example, the molec- ular structure of genes make interactions with other components a highly-structured and, therefore, a sparse process. Penalized Gaussian graphical models have been used to estimate sparse networks. H…
Optimal switches in multi-inventory systems
2007
Given a switched multi-inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function related to the cost of the resets. We discuss a family of instances that can be solved in polynomial time by linear programming. We do this by introducing a set-covering formulation with a totally unimodular constraint matrix.
Environmental sustainability in non-residential buildings by automating and optimization LENI index
2018
Directive 2002/91 / EC as amended by 2010/31 / EU introduces procedures for energy certification aimed to determine, through the numerical indicators, the overall energy efficiency of the buildings, but notes the thermal and electric consumption. Often, the power consumption is incorrectly underestimated, this consumption would to be considered with great attention. In fact, compared to a committed capacity of less, compared to thermal plants, have times of utilization often far higher, leading to energy requirements to levels similar or even higher than those thermal, being the conversion factor of the electrical energy increasingly high. Leaving aside the procedural scheme energy certific…
Partial spatial equilibria with fuzzy constraints
1981
It is implicitly accepted by spatial economic analysis that the economic behaviour of agents located in given spaces (market areas, regions, etc.) is precise, that is to say, their behaviour is such that a possible action (consumption, production) is, or is not, preferable to another. In otherwords, economic agents are assumed to make accurate economic calculations and optimise the objective functions under strict constraints of resource limitation. These objective functions have clearly defined arguments and well-controlled parameters.
A review on optimization and cost-optimal methodologies in low-energy buildings design and environmental considerations
2019
Abstract The topic of low-energy buildings received a widespread and growing interest in last years, thanks to energy saving policies of developed countries. The design of a low-energy building is addressed with energy saving measures and renewable energy generation, but the correct assessment of phenomena occurring in a building usually requires to perform dynamic simulations and to analyze multiple scenarios to attain the optimal solution. The optimality of a technical solution may be subject to contrasting constraints and objectives. For this reason, designers may employ mathematical optimization techniques, a non-familiar topic to most of building designers. In this paper, a review on o…