Finding Feasible Solutions To A Linear Programming Worksheet - Columbia University In The City Of New York Page 7
ADVERTISEMENT
1
2
3
4
5
6
7
8
9
10
11
12
13
14The bevco Example
Here is a more involved example, that comes from the Bevco problem in
the book. In this case the LP is:
minimize
2x
+
3x
(14)
1
2
subject to
.5x
+ .25x
4
(15)
1
2
x
+
3x
20
(16)
1
2
x
+
x
= 10
(17)
1
2
x
, x
, x
0 .
(18)
1
2
3
Note that the solution in which x
and x
are both zero (and the slacks and
1
2
excesses non zero) is not feasible. We need to introduce artificial variables
to help get an initial feasible solution.
We also negate the objective function and convert to a maximization
problem.
ADVERTISEMENT
0 votes
Related Articles
Related forms
Form Tc 208 - Income And Expense Schedule For A Hotel - The Tax Com Mis Sion Of The City Of New York
Financial
Form Tc200 Instructions For 2004 - Addendum To Application For Correction - The Tax Commission Of The City Of New York
Financial
Form Tc201 Instructions For 2004 - Income And Expense Schedule For Rent Producing Properties - The Tax Commission Of The City Of New York
Financial
Related Categories
Parent category: Education