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.
Duality (optimization)In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives, the primal problem or the dual problem. If the primal is a minimization problem then the dual is a maximization problem (and vice versa). Any feasible solution to the primal (minimization) problem is at least as large as any feasible solution to the dual (maximization) problem.
Renewable energyRenewable energy is energy from renewable resources that are naturally replenished on a human timescale. Renewable resources include sunlight, wind, the movement of water, and geothermal heat. Although most renewable energy sources are sustainable, some are not. For example, some biomass sources are considered unsustainable at current rates of exploitation. Renewable energy is often used for electricity generation, heating and cooling.
FuelA fuel is any material that can be made to react with other substances so that it releases energy as thermal energy or to be used for work. The concept was originally applied solely to those materials capable of releasing chemical energy but has since also been applied to other sources of heat energy, such as nuclear energy (via nuclear fission and nuclear fusion). The heat energy released by reactions of fuels can be converted into mechanical energy via a heat engine.
Solid oxide electrolyzer cellA solid oxide electrolyzer cell (SOEC) is a solid oxide fuel cell that runs in regenerative mode to achieve the electrolysis of water (and/or carbon dioxide) by using a solid oxide, or ceramic, electrolyte to produce hydrogen gas (and/or carbon monoxide) and oxygen. The production of pure hydrogen is compelling because it is a clean fuel that can be stored, making it a potential alternative to batteries, methane, and other energy sources (see hydrogen economy).
Linear programming relaxationIn mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable. For example, in a 0–1 integer program, all constraints are of the form The relaxation of the original integer program instead uses a collection of linear constraints The resulting relaxation is a linear program, hence the name.
Alkaline fuel cellThe alkaline fuel cell (AFC), also known as the Bacon fuel cell after its British inventor, Francis Thomas Bacon, is one of the most developed fuel cell technologies. Alkaline fuel cells consume hydrogen and pure oxygen, to produce potable water, heat, and electricity. They are among the most efficient fuel cells, having the potential to reach 70%. NASA has used alkaline fuel cells since the mid-1960s, in the Apollo-series missions and on the Space Shuttle. The fuel cell produces power through a redox reaction between hydrogen and oxygen.
Renewable energy commercializationRenewable energy commercialization involves the deployment of three generations of renewable energy technologies dating back more than 100 years. First-generation technologies, which are already mature and economically competitive, include biomass, hydroelectricity, geothermal power and heat. Second-generation technologies are market-ready and are being deployed at the present time; they include solar heating, photovoltaics, wind power, solar thermal power stations, and modern forms of bioenergy.
Simplex algorithmIn mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial cones, and these become proper simplices with an additional constraint. The simplicial cones in question are the corners (i.e., the neighborhoods of the vertices) of a geometric object called a polytope.
Cutting-plane methodIn mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are commonly used to find integer solutions to mixed integer linear programming (MILP) problems, as well as to solve general, not necessarily differentiable convex optimization problems. The use of cutting planes to solve MILP was introduced by Ralph E. Gomory.
