Scribd
Upload
54 views2 pages

Metodo Simplex: x1+1.5 x2 2 x1+2 x2 0 x2 0

The document describes a linear programming problem to maximize the objective function of x1 + 1.5x2, subject to the constraints of 2x1 + 2x2 ≤ 160, x1 + 2x2 ≤ 120, 4x1 + 2x2 ≤ 280, and non-negativity constraints of x1 ≥ 0 and x2 ≥ 0. The optimal solution was found to be x1 = 40 and x2 = 40, with an optimal objective value of 100.

Uploaded by

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

Metodo Simplex: x1+1.5 x2 2 x1+2 x2 0 x2 0

The document describes a linear programming problem to maximize the objective function of x1 + 1.5x2, subject to the constraints of 2x1 + 2x2 ≤ 160, x1 + 2x2 ≤ 120, 4x1 + 2x2 ≤ 280, and non-negativity constraints of x1 ≥ 0 and x2 ≥ 0. The optimal solution was found to be x1 = 40 and x2 = 40, with an optimal objective value of 100.

Uploaded by

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

METODO SIMPLEX

max=x1+1.5*x2;
2*x1+2*x2<=160;
x1+2*x2<=120;
4*x1+2*x2<=280;
x1>=0;
x2>=0;
Global optimal solution found.
Objective value:
Infeasibilities:
Total solver iterations:
Elapsed runtime seconds:

100.0000
0.000000
2
0.05

Model Class:

LP

Total variables:
Nonlinear variables:
Integer variables:

2
0
0

Total constraints:
Nonlinear constraints:

6
0

Total nonzeros:
Nonlinear nonzeros:

Variable
X1
X2
Row
1
2
3
4
5
6

10
0

Value
40.00000
40.00000
Slack or Surplus
100.0000
0.000000
0.000000
40.00000
40.00000
40.00000

RESPUESTA:

Reduced Cost
0.000000
0.000000
Dual Price
1.000000
0.2500000
0.5000000
0.000000
0.000000
0.000000

Zopt = 100
X1 = 40
X2 = 40

Milton Richard Castaeda Bermejo

Pgina 1

Milton Richard Castaeda Bermejo

Pgina 2

You might also like