Scribd
Upload
12 views3 pages

Problema 3

The document outlines a linear programming problem titled 'problema 2', aiming to maximize a function subject to specific constraints. It details the simplex tableau iterations, showing the progression of the solution through three iterations, ultimately achieving a maximum value of 300. The final solution indicates the values of the variables x1, x2, and slack variables at optimality.

Uploaded by

LucasJ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views3 pages

Problema 3

The document outlines a linear programming problem titled 'problema 2', aiming to maximize a function subject to specific constraints. It details the simplex tableau iterations, showing the progression of the solution through three iterations, ultimately achieving a maximum value of 300. The final solution indicates the values of the variables x1, x2, and slack variables at optimality.

Uploaded by

LucasJ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

TORA Optimization System, Windows®-version 1.

00
Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
domingo, Mayo 18, 2025 20:15

LINEAR PROGRAM -- ORIGINAL DATA

Title: problema 2

x1 x2
Maximize 1.50 2.75
Subject to
( 1) 0.60 1.00 <= 200.00
( 2) 1.00 1.00 <= 700.00
( 3) 1.00 0.00 <= 200.00
( 4) 0.00 1.00 <= 0.00

Lower Bound 0.00 0.00


Upper Bound infinity infinity
Unrestr'd (y/n)? n n
SIMPLEX TABLEAUS -- (Starting All-Slack Method)

Title: problema 2

Iteration 1
Basic x1 x2 sx3 sx4 sx5 sx6
z (max) -1.50 -2.75 0.00 0.00 0.00 0.00
sx3 0.60 1.00 1.00 0.00 0.00 0.00
sx4 1.00 1.00 0.00 1.00 0.00 0.00
sx5 1.00 0.00 0.00 0.00 1.00 0.00
sx6 0.00 1.00 0.00 0.00 0.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Solution
z (max) 0.00
sx3 200.00
sx4 700.00
sx5 200.00
sx6 0.00

Iteration 2
Basic x1 x2 sx3 sx4 sx5 sx6
z (max) -1.50 0.00 0.00 0.00 0.00 2.75
sx3 0.60 0.00 1.00 0.00 0.00 -1.00
sx4 1.00 0.00 0.00 1.00 0.00 -1.00
sx5 1.00 0.00 0.00 0.00 1.00 0.00
x2 0.00 1.00 0.00 0.00 0.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Solution
z (max) 0.00
sx3 200.00
sx4 700.00
sx5 200.00
x2 0.00

Iteration 3
Basic x1 x2 sx3 sx4 sx5 sx6
z (max) 0.00 0.00 0.00 0.00 1.50 2.75
sx3 0.00 0.00 1.00 0.00 -0.60 -1.00
sx4 0.00 0.00 0.00 1.00 -1.00 -1.00
x1 1.00 0.00 0.00 0.00 1.00 0.00
x2 0.00 1.00 0.00 0.00 0.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Solution
z (max) 300.00
sx3 80.00
sx4 500.00
x1 200.00
x2 0.00

You might also like