對偶線性規劃
Sign in to saveAlso known as duality
a linear program derived by inverting constraints and variables
In the Vinony graph
Vinony's link graph records 24 inbound references to 對偶線性規劃, and connects out to International Standard Book Number, John von Neumann and digital object identifier.
It is catalogued under the topic Linear programming.
Vinony links it to 6 Wikipedia language editions.
Wikidata facts
- Instance of
- concept
- Subclass of
- convex optimization
Show 1 more fact
- facet of
- linear programming
via Wikidata · CC0
Article · 中文
一个线性规划问题（“原问题”）的对偶线性规划问题（“对偶问题”）是另一个线性规划问题，由原问题以一定方式派生而来： * 原问题中的每个变量都变为对偶问题中的一个限制条件； * 原问题中的每个限制条件都变为对偶问题中的一个变量； * 原问题若是求目标函数的最大值，则对偶问题是求最小值，反之亦然。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
International Standard Book Number
Entity
John von Neumann
Entity
digital object identifier
Entity
OCLC, Inc.
Entity
coefficient
Entity
linear programming
Entity
John George Kemeny
Entity
László Lovász
Entity
simplex algorithm
Entity
Oskar Morgenstern
Entity
Mathematical Reviews
Entity
resource allocation
Entity
Max-flow min-cut theorem
Entity
duality
Entity
duality
Entity
shadow price
Entity
König's theorem
Entity
Jiří Matoušek
Entity
Convex conjugate
Entity
minimax theorem
Entity