Simplex Problem

max=3*a+4*b+3*c;
2*a+1*b+1*c<=18;
1*a+3*b+1*c<=42;
3*a+2*b+1*c<=24;

Global optimal solution found at iteration : 2

Objective value :
60.00000

Variable Value
Reduced Cost
A 0.000000
4.000000
B 6.000000
0.000000
C 12.00000
0.000000
 Row Slack or Surplus Dual
Price
1 60.00000
1.000000
2 0.000000
2.000000
3 12.00000
0.000000
4 0.000000
1.000000

Transportation Problem-
 A B C Supply

1 6 8 10 150

2 7 11 11 175

3 4 5 12 275

Demand 200 100 300 600

min=6*a+8*b+10*c+7*d+11*e+11*f+4*g+5*h+12*i;
6*a+8*b+10*c=150;
7*d+11*e+11*f=175;
4*g+5*h+12*i=275;
6*a+7*d+4*g=200;
8*b+11*e+5*h=100;
10*c+11*f+12*i=300;

Sol-
Global optimal solution found at iteration: 0
Objective value: 600.0000

Variable Value Reduced Cost

A 0.000000 0.000000
B 0.000000 0.000000
C 15.00000 0.000000
D 0.000000 0.000000
E 2.272727 0.000000
F 13.63636 0.000000
G 50.00000 0.000000
H 15.00000 0.000000
I 0.000000 0.000000
 Row Slack or Surplus Dual Price
1 600.0000 -1.000000
2 0.000000 -1.000000
3 0.000000 -1.000000
4 0.000000 -1.000000
5 0.000000 0.000000
6 0.000000 0.000000
7 0.000000 0.000000

Assignment Problem

A B C

1 6 8 10

2 7 11 11

3 4 5 12

Sol-

A B C

1 6 8 10 1

2 7 11 11 1

3 4 5 12 1

1 1 1
min=6*a+8*b+10*c+7*d+11*e+11*f+4*g+5*h+12*i;
6*a+8*b+10*c=1;
7*d+11*e+11*f=1;
4*g+5*h+12*i=1;
6*a+7*d+4*g=1;
8*b+11*e+5*h=1;
10*c+11*f+12*i=1;

Output-
Global optimal solution found at iteration: 4
Objective value: 3.000000

Variable Value Reduced Cost

A 0.000000 0.000000
B 0.1250000 0.000000
C 0.000000 0.000000
D 0.1428571 0.000000
E 0.000000 0.000000
F 0.000000 0.000000
G 0.000000 0.000000
H 0.000000 0.000000
I 0.8333333E-01 0.000000

Row Slack or Surplus Dual Price

1 3.000000 -1.000000
2 0.000000 -1.000000
3 0.000000 -1.000000
4 0.000000 -1.000000
5 0.000000 0.000000
 6 0.000000 0.000000
7 0.000000 0.000000

Simplex Problem

max=3*a+4*b+3*c;
2*a+1*b+1*c<=18;
1*a+3*b+1*c<=42;
3*a+2*b+1*c<=24;

TORA Optimization System - Version 2.0, Oct 1996

Copyright (c) 1989-96 Hamdy A. Taha. All Rights Reserved.

Date: Mon Mar 26 15:35:56 2018

*** OPTIMUM SOLUTION SUMMARY ***

----------------------------------------------------------------------------

Title: simplex

Final iteration No: 3

Objective value (max) = 60.0000

--------------------------------------------------------------------

Variable Value Obj Coeff Obj Val Contrib

--------------------------------------------------------------------
x1 0.0000 3.0000 0.0000

x2 6.0000 4.0000 24.0000

x3 12.0000 3.0000 36.0000

---------------------------------------------------------------

Constraint RHS Slack(-)/Surplus(+)

---------------------------------------------------------------

1 (<) 18.0000 0.0000-

2 (<) 42.0000 12.0000-

3 (<) 24.0000 0.0000-

Transportation Problem-

A B C Supply

1 6 8 10 150

2 7 11 11 175
 3 4 5 12 275

Demand 200 100 300 600

TORA Optimization System - Version 2.0, Oct 1996

Copyright (c) 1989-96 Hamdy A. Taha. All Rights Reserved.

Date: Mon Mar 26 15:40:53 2018

OPTIMUM TRANSPORTATION SOLUTION

Title: transportation

Size:(3 x 3)

Final iteration no: 2

Total cost = 4525.0000

==> ALTERNATIVE soln detected at route <1,1>)

------------------------------------------------------------------------------

From To Amount Unit Cost Route Cost

------------------------------------------------------------------------------

S1 D1 0 6.00 0.00

D2 0 8.00 0.00

D3 150 10.00 1500.00

S2 D1 25 7.00 175.00

D2 0 11.00 0.00

D3 150 11.00 1650.00

S3 D1 175 4.00 700.00

D2 100 5.00 500.00

D3 0 12.00 0.00
Summary of Transportation Costs

------------------------------------------------------------------------------

Node Supply/Demand Total Cost Av. Cost/unit

------------------------------------------------------------------------------

S1 150

TORA Optimization System - Version 2.0, Oct 1996

Copyright (c) 1989-96 Hamdy A. Taha. All Rights Reserved.

Date: Mon Mar 26 15:46:48 2018

TRANSPORTATION MODEL

Title: table

Size:(3 x 3)

Final Iteration No: 2

Total cost = 4525.0000

==> ALTERNATIVE soln detected at route <1,1>

Ui
 D1 D2 D3 SUPPLY

|-----------|-----------|-----------|

|6 |8 |10 | 10.00

| | |

S1 | | | 150 | 150

| 0.00| -1.00| 0.00|

|-----------|-----------|-----------|

|7 |11 |11 | 11.00

| |

S2 | 25 | | 150 | 175

| 0.00| -3.00| 0.00|

|-----------|-----------|---------
Assignment Problem

A B C

1 6 8 10

2 7 11 11

3 4 5 12

Sol-

A B C

1 6 8 10 1

2 7 11 11 1

3 4 5 12 1

1 1 1

TORA Optimization System - Version 2.0, Oct 1996

Copyright (c) 1989-96 Hamdy A. Taha. All Rights Reserved.

Date: Mon Mar 26 15:43:06 2018

OPTIMUM TRANSPORTATION SOLUTION

Title: assign

Size:(3 x 3)

Final iteration no: 2

Total cost = 22.0000

==> ALTERNATIVE soln detected at route <1,1>)

------------------------------------------------------------------------------
From To Amount Unit Cost Route Cost

------------------------------------------------------------------------------

S1 D1 0 6.00 0.00

D2 0 8.00 0.00

D3 1 10.00 10.00

S2 D1 1 7.00 7.00

D2 0 11.00 0.00

D3 0 11.00 0.00

S3 D1 0 4.00 0.00

D2 1 5.00 5.00

D3 0 12.00 0.00

Summary of Transportation Costs

------------------------------------------------------------------------------

Node Supply/Demand Total Cost Av. Cost/unit

------------------------------------------------------------------------------

S1 1

TORA Optimization System - Version 2.0, Oct 1996

Copyright (c) 1989-96 Hamdy A. Taha. All Rights Reserved.

Date: Mon Mar 26 15:55:28 2018

TRANSPORTATION MODEL

Title: assign

Size:(3 x 3)

Final Iteration No: 2

Total cost = 22.0000

==> ALTERNATIVE soln detected at route <1,1>

Ui

D1 D2 D3 SUPPLY

|-----------|-----------|-----------|

|6 |8 |10 | 10.00

| | |

S1 | | | 1 | 1

| 0.00| -1.00| 0.00|

|-----------|-----------|-----------|

|7 |11 |11 | 11.00

| |

S2 | 1 | | 0 | 1

| 0.00| -3.00| 0.00|

|-----------|-----------|-----------|

|4 |5 |12 | 8.00

| |

S3 | 0 | 1 | |