9. Duality
Let's return to the production problem (1) and now imagine that a buyer shows up to buy all the resources b = (b1, b2, b3)T = (81, 55, 20)T available in the company. The buyer offers the company unit prices y = (y1, y2, y3)T for each of the resources. The company will agree to sell it all its resources only if it obtains for each product Pj a selling price at least equal to the profit cj it would make by selling its products. This translates algebraically...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Bibliography
-
(1) - BILLIONNET (A.) - Optimisation discrète – De la modélisation à la résolution par des logiciels de programmation mathématique. - Dunod (2007).
-
(2) - BREZINSKI (C.) - Initiation à la programmation linéaire et à l'algorithme du simplexe. - Ellipse, Paris (2006).
-
(3)...
Also in our database
-
MINOUX (M.) - Optimisation en nombres entiers. - [AF 1 251], Méthodes numériques (2008).
...
Software tools
GLPK – Gnu Linear Programming Kit (Linux version) [Software]
LPSOLVE, (multi-platform version under LGPL license)
IBM ILOG CPLEX Optimization Studio (multi-platform version)
MATLAB – Optimization toolbox
CMPL – <Coliop|Coin> Mathematical Programming Language
Websites
COIN-OR: COmputational INfrastructure for Operations Research
http://www.coin-or.org/
ROADEF: French Society for Operational Research and Decision Support
http://www.roadef.org/content/index.htm
ENSTA Operations Research Portal
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!