Optimization problem: Difference between revisions

Revision as of 01:56, 28 January 2018

Revision as of 03:56, 28 January 2018

Line 21:

==Combinatorial optimization problem==

Formally, a [[combinatorial optimization]] problem <math>A</math> is a quadruple{{Citation needed|date=January 2018}} <math>(I, f, m, g)</math>, where

* <math>I</math> is a [[Set (mathematics)|set]] of instances;

* given an instance <math>x \in I</math>, <math>f(x)</math> is the set of feasible solutions;