Optimization problemIn mathematics, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete: An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.
Zero heating buildingZero-heating building or nearly zero-heating building (nZHB) is a building having essentially zero heating demand, defined as having heating demand, Q’NH, less than 3 kWh/(m2a). The zero-heating building is intended for use in heating-dominated areas. The purpose of the zero-heating building is to supersede net-zero energy buildings as a way to bring building-related greenhouse gas emissions to zero in the EU. Zero-heating buildings address flawed net-zero energy buildings: the requirement for seasonal energy storage, in some cases poor comfort of living and narrow design options.
Program optimizationIn computer science, program optimization, code optimization, or software optimization, is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources. In general, a computer program may be optimized so that it executes more rapidly, or to make it capable of operating with less memory storage or other resources, or draw less power. Although the word "optimization" shares the same root as "optimal", it is rare for the process of optimization to produce a truly optimal system.
Energy-plus buildingAn energy-plus building (also called: plus-energy house, efficiency-plus house) produces more energy from renewable energy sources, over the course of a year, than it imports from external sources. This is achieved using a combination of microgeneration technology and low-energy building techniques, such as: passive solar building design, insulation and careful site selection and placement. A reduction of modern conveniences can also contribute to energy savings, however many energy-plus houses are almost indistinguishable from a traditional home, preferring instead to use highly energy-efficient appliances, fixtures, etc.
ProjectA project is any undertaking, carried out individually or collaboratively and possibly involving research or design, that is carefully planned to achieve a particular goal. An alternative view sees a project managerially as a sequence of events: a "set of interrelated tasks to be executed over a fixed period and within certain cost and other limitations". A project may be a temporary (rather than a permanent) social system (work system), possibly staffed by teams (within or across organizations) to accomplish particular tasks under time constraints.
Convex optimizationConvex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.
Phase-change materialA phase-change material (PCM) is a substance which releases/absorbs sufficient energy at phase transition to provide useful heat or cooling. Generally the transition will be from one of the first two fundamental states of matter - solid and liquid - to the other. The phase transition may also be between non-classical states of matter, such as the conformity of crystals, where the material goes from conforming to one crystalline structure to conforming to another, which may be a higher or lower energy state.
Linear programmingLinear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints.
Integer programmingAn integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
Thin-film solar cellThin-film solar cells are made by depositing one or more thin layers (thin films or TFs) of photovoltaic material onto a substrate, such as glass, plastic or metal. Thin-film solar cells are typically a few nanometers (nm) to a few microns (μm) thick–much thinner than the wafers used in conventional crystalline silicon (c-Si) based solar cells, which can be up to 200 μm thick. Thin-film solar cells are commercially used in several technologies, including cadmium telluride (CdTe), copper indium gallium diselenide (CIGS), and amorphous thin-film silicon (a-Si, TF-Si).
