Example: barber
Duality in Linear Programming 4

Duality in Linear Programming 4

Back to document page

Problem (2) is called the dual of Problem (1). Since Problem (2) has a name, it is helpful to have a generic name for the original linear program. Problem (1) has come to be called the primal. In solving any linear program by the simplex method, we also determine the shadow prices associated with the constraints.

  Problem, Solving

Download Duality in Linear Programming 4


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries