Your SlideShare is downloading. ×
Semana 3 ejercicios lindo
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Saving this for later?

Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime - even offline.

Text the download link to your phone

Standard text messaging rates apply

Semana 3 ejercicios lindo

320
views

Published on


0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
320
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
7
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. EJERCICIO 1
  • 2. LP OPTIMUM FOUND AT STEP 1 OBJECTIVE FUNCTION VALUE 1) 8.000000El costo mínimo es de s/8VARIABLE VALUE REDUCED COST X1 1.000000 0.000000El valor de x1 es 1X2 1.000000 0.000000El valor de x2 es 1ROW SLACK OR SURPLUS DUAL PRICES2) 0.000000 -3.000000 3) 3.000000 0.000000 4) 0.000000 -2.000000NO. ITERATIONS= 1RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGESVARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X1 3.000000 2.000000 3.000000 X2 5.000000 INFINITY 2.000000
  • 3. RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLERHS INCREASE DECREASE 2 2.000000 3.000000 1.000000 3 4.000000 INFINITY 3.000000 4 1.000000 1.000000 1.000000
  • 4. EJERCICIO 2:
  • 5. LP OPTIMUM FOUND AT STEP 1OBJECTIVEFUNCTIONVALUE 1) 1770.000La utilidad maximaes 1770 dólaresVARIABLE VALUE REDUCED COST X11 1000.000000 0.000000Numero de libras: 1000 libras de trigo se destina para el alimento 1X21 250.000000 0.000000250 libras de alfalfa se destinan para el alimento 1X12 0.000000 0.2500000 libras de trigo se destinan para el alimento 2X22 550.000000 0.000000550 libras de alfalfa se destinan para el alimento 2ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 1.050000 3) 0.000000 0.900000 4) 0.000000 -0.250000 5) 70.000000 0.000000 6) 1200.000000 0.000000 7) 500.000000 0.000000
  • 6. NO. ITERATIONS= 1RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGESVARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X11 1.000000 INFINITY 0.250000 X21 1.100000 INFINITY 0.200000 X12 0.800000 0.250000 INFINITY X22 0.900000 0.200000 0.900000 RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE 2 1000.000000 280.000000 960.000000 3 800.000000 INFINITY 175.000000 4 0.000000 200.000000 56.000000 5 0.000000 70.000000 INFINITY 6 50.000000 1200.000000 INFINITY7 50.000000 500.000000 INFINITY
  • 7. EJERCICIO 3
  • 8. LP OPTIMUM FOUND AT STEP 1 OBJECTIVE FUNCTION VALUE 1) 225.0000VARIABLE VALUE REDUCED COST X11 0.000000 0.650000 X21 0.000000 0.670000 X12 150.000000 0.000000 X22 0.000000 0.850000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 1.500000 3) 210.000000 0.000000NO. ITERATIONS= 1RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGESVARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X11 0.850000 0.650000 INFINITY
  • 9. X21 -0.670000 0.670000 INFINITYX12 1.500000 INFINITY 0.650000X22 -0.850000 0.850000 INFINITY RIGHTHAND SIDE RANGESROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE2 150.000000 INFINITY 150.0000003 210.000000 INFINITY 210.000000