MediaWiki API result

{
    "batchcomplete": "",
    "continue": {
        "sroffset": 10,
        "continue": "-||"
    },
    "query": {
        "searchinfo": {
            "totalhits": 12
        },
        "search": [
            {
                "ns": 0,
                "title": "Classical robust optimization",
                "pageid": 1318,
                "size": 4435,
                "wordcount": 641,
                "snippet": "...e given values of (x,y). For this example, P is simplified to a finite set <span class='searchmatch'>meaning</span> that for each (c,d) within the set, there is a constraint cX + dY &lt;= 15.\n",
                "timestamp": "2022-04-01T15:35:47Z"
            },
            {
                "ns": 0,
                "title": "Markov decision process",
                "pageid": 854,
                "size": 17354,
                "wordcount": 2650,
                "snippet": "....&lt;math&gt;^2&lt;/math&gt; But because many applications may have infinite horizons, <span class='searchmatch'>meaning</span> the agent will always have to make decisions and continuously try to maximi\nThe policy is a function of the current state, <span class='searchmatch'>meaning</span> at each time step a new policy is calculated considering the present inform\n",
                "timestamp": "2020-12-21T11:34:23Z"
            },
            {
                "ns": 0,
                "title": "Unit commitment problem",
                "pageid": 1040,
                "size": 13249,
                "wordcount": 1978,
                "snippet": "...s to the unit commitment problem, the economic aspects are always involved <span class='searchmatch'>meaning</span> that the allocation of power generation (energy output) for each committing\n",
                "timestamp": "2021-12-16T05:46:22Z"
            },
            {
                "ns": 0,
                "title": "Momentum",
                "pageid": 1023,
                "size": 14389,
                "wordcount": 2078,
                "snippet": "...convex functions, a non-convex cost function can have many local minima's <span class='searchmatch'>meaning</span> the first local minima found is not guaranteed to be the global minima. At \n",
                "timestamp": "2021-12-16T00:24:06Z"
            },
            {
                "ns": 0,
                "title": "Quadratic programming",
                "pageid": 40,
                "size": 15980,
                "wordcount": 2279,
                "snippet": "...sition:relative; bottom: 0.3em;&quot;&gt;6&lt;/span&gt;  This is a sufficient condition, <span class='searchmatch'>meaning</span> that it is not required to be true in order for a local minimum to be the u\n",
                "timestamp": "2022-06-12T21:32:33Z"
            },
            {
                "ns": 0,
                "title": "Lagrangean duality",
                "pageid": 1034,
                "size": 17642,
                "wordcount": 2662,
                "snippet": "...applications, the dual formulation of a problem has a specific real-world <span class='searchmatch'>meaning</span>. The following are examples of real-world applications for Lagrangean Duali\n",
                "timestamp": "2021-12-16T03:01:13Z"
            },
            {
                "ns": 0,
                "title": "Simplex algorithm",
                "pageid": 656,
                "size": 15987,
                "wordcount": 2414,
                "snippet": "...vot process, the coefficient for the selected pivot element should be one, <span class='searchmatch'>meaning</span> the reciprocal of this coefficient should be multiplied to every element wi\n",
                "timestamp": "2021-10-05T12:26:44Z"
            },
            {
                "ns": 0,
                "title": "Matrix game (LP for game theory)",
                "pageid": 686,
                "size": 16769,
                "wordcount": 2700,
                "snippet": "...average. In the event that v* = u* = 0, the game is considered to be fair, <span class='searchmatch'>meaning</span> neither player has a distinct disadvantage. In order to illustrate the powe\n",
                "timestamp": "2020-12-21T11:32:34Z"
            },
            {
                "ns": 0,
                "title": "Wing shape optimization",
                "pageid": 1064,
                "size": 18262,
                "wordcount": 2687,
                "snippet": "...resolve by the flow solver. Furthermore, storing a high-resolution shape, <span class='searchmatch'>meaning</span> a large number of points, is computationally expensive.&lt;ref name=&quot;:0&quot;&gt;Silis\n",
                "timestamp": "2021-12-16T04:59:39Z"
            },
            {
                "ns": 0,
                "title": "Mixed-integer linear fractional programming (MILFP)",
                "pageid": 751,
                "size": 25186,
                "wordcount": 3776,
                "snippet": "! Nomenclature !! <span class='searchmatch'>Meaning</span>\n",
                "timestamp": "2020-12-21T11:38:35Z"
            }
        ]
    }
}