💡 Words with a Similar Meaning to "Optimization problem"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| objective functionnoun | (mathematics) A function to be maximized or minimized in optimization theory. |
| maximizationnoun | The act of raising something to its greatest value or extent. |
| constraintnoun | Something that constrains; a restriction. |
| minimizationnoun | The act of lowering something to its smallest value or extent. |
| approximation algorithmnoun | (computing) A method of finding a nearly optimal solution to an optimization problem that cannot be solved exactly within a reasonable time. |
| corner solutionnoun | (mathematics, economics) A solution to a minimization or maximization problem where an interior solution is infeasible. |
| maximinnoun | (decision theory, game theory) A rule to identify the worst outcome of each possible option to find one's best (maximum payoff) play. |
| maxflownoun | (optimization theory) maximum flow |
| penalty functionnoun | (mathematics) Any function that applies constraints to a maximum or minimum problem |
| hillclimbingnoun | (general) The act of climbing a hill. |
| superiorizationnoun | (mathematics) An iterative form of optimization. |
| infomaxnoun | (mathematics) A particular optimization method, prescribing that a function that maps a set of inputs to a set of outputs should maximize the average mutual information between the two sets, subject to constraints. |
| maximaxnoun | (economics, computer science, decision theory) A strategy or algorithm that seeks to maximize the maximum possible result (that is, that prefers the alternative with the chance of the best possible outcome, even if its expected outcome and its worst possible outcome are worse than other alternatives); often used attributively, as "maximax strategy", "maximax approach", and so on. |
| miniminnoun | (economics, computer science, decision theory) A strategy or algorithm that seeks to minimize the minimum possible result. |
| constant problemnoun | (mathematics) The problem of deciding whether a given expression is equal to zero. |
| greedy propertynoun | (computer science) The property of being globally solvable optimally by making optimal decisions locally. |
| god's algorithmnoun | (combination puzzles) An optimal algorithm that finds the solution with the fewest moves. |
| greedy algorithmnoun | Any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. |
| linear programmingnoun | (mathematics) The branch of mathematics concerned with the minimization or maximization of a linear function of several variables and inequalities; used in many branches of industry to minimize costs or maximize production. |
| traveling-salesman problemnoun | Alternative spelling of travelling salesman problem. [(mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city.] |
Translate “Optimization problem” into Another Language
Pick a language — the word will be pre-filled in the translator.