Jump to content

Talk:Optimization problem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 02:41, 11 January 2020 (Signing comment by 192.159.178.211 - "Combinatorial optimization problem: "). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconSystems Stub‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Systems, which collaborates on articles related to systems and systems science.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-importance on the project's importance scale.
Taskforce icon
This article is not associated with a particular field. Fields are listed on the template page.

Changed "four-tuple" to read "quardruple", as this is correct, AFAIK. 212.19.66.62 18:59, 21 March 2006 (UTC)Duggan von Metebelis III[reply]

Combinatorial optimization problem

Firstly discussion should be on the Combinatorial optimization problem wikipedia page. Secondly that page mentions nothing of a Combinatorial optimization problem being a 4-tuple. Why is the structure of a Combinatorial optimization problem so radically different from the continuous version. I.e. there is a feasible set that happens to be combinatorial and an objective.

Why does NPO complete link here? — Preceding unsigned comment added by 192.159.178.211 (talk) 02:39, 11 January 2020 (UTC)[reply]