and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into...

generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from...

Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the...

multiattribute optimization) is an area of multiple-criteria decision making that is concerned with mathematical optimization problems involving more...

Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently...

Quantum optimization algorithms are quantum algorithms that are used to solve optimization problems. Mathematical optimization deals with finding the best...

operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems that can be reduced to finding...

Shape optimization is part of the field of optimal control theory. The typical problem is to find the shape which is optimal in that it minimizes a certain...

the performance of the system. Topology optimization is different from shape optimization and sizing optimization in the sense that the design can attain...

an optimization problem where some of the constraints are not linear equalities or the objective function is not a linear function. An optimization problem...

In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function...

The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items...

minimizes costs like financial risk, resulting in a multi-objective optimization problem. Factors being considered may range from tangible (such as assets...

In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives...

set of unknowns to be found using optimization. Trajectory optimization problem A special type of optimization problem where the decision variables are...

algorithms are commonly used to generate high-quality solutions to optimization and search problems via biologically inspired operators such as selection, crossover...

In computational science, particle swarm optimization (PSO) is a computational method that optimizes a problem by iteratively trying to improve a candidate...

E. Bellman, is a technique in dynamic programming which breaks a optimization problem into a sequence of simpler subproblems, as Bellman's “principle of...

unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide...

heuristic method for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution...

NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem, the vehicle...

Multi-disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of...

been studied from various angles. Optimal facility location is an optimization problem: deciding where to place the facility in order to minimize transportation...

Design optimization is an engineering design methodology using a mathematical formulation of a design problem to support selection of the optimal design...

single-objective optimization cases are presented. In the second part, test functions with their respective Pareto fronts for multi-objective optimization problems (MOP)...

tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial optimization. While...

It is an optimization problem in mathematics that arises from applications in industry. In terms of computational complexity, the problem is an NP-hard...

the graph. In computer science, the problem of finding a minimum vertex cover is a classical optimization problem. It is NP-hard, so it cannot be solved...

routing Scheduling Problems that are decidable but not NP-complete, often are optimization problems: Knapsack optimization problems Integer programming...

programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject...