Notes on Linear Programming: Part VII The Dual Simplex Algorithm
$20.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
A procedure for solving the dual problem by means of variables associated with a basis that may have negative as well as positive values in the iterative process before an optimum is reached.
Show More
Show Less