Scribd
Upload
70 views

Metodo Simplex QMWINDOWS

This document summarizes the solution to a linear programming problem using the simplex method. The objective is to maximize 10X1 + 8X2. There are three constraints: X1 + X2 >= 80, X1 + 2X2 <= 100, and X1 = 70. The simplex method proceeds through two phases, first setting up an initial basic feasible solution and then optimizing the objective function. It finds the optimal solution is X1 = 70, X2 = 10, with an optimal value (Z) of 780.

Uploaded by

Margarita Aguagallo Janeta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
70 views

Metodo Simplex QMWINDOWS

This document summarizes the solution to a linear programming problem using the simplex method. The objective is to maximize 10X1 + 8X2. There are three constraints: X1 + X2 >= 80, X1 + 2X2 <= 100, and X1 = 70. The simplex method proceeds through two phases, first setting up an initial basic feasible solution and then optimizing the objective function. It finds the optimal solution is X1 = 70, X2 = 10, with an optimal value (Z) of 780.

Uploaded by

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

UNIVERSIDAD DE LAS FUERZAS ARMADAS ESPE

INVESTIGACION OPERATIVA

Docente: Ing. Víctor Pachacama

Maximización y Minimización Método Simplex

Nombre: Margarita Aguagallo NRC: 5574 Fecha: 29/05/2019

Función Objetivo: 10X1+8X2+0S1+0S2+Mm1+Mn3

X1 X2 RHS Equation form


Minimize 10 8 Min 10X1 + 8X2
A 1 1 >= 80 X1 + X2 >= 80

B 1 2 <= 100 X1 + 2X2 <= 100


C 1 0 = 70 X1 = 70

Variable Status Value X1 X2 RHS Dual


X1 Basic 70 Minimize 10 8
X2 Basic 10 A 1 1 >= 80 -8
surplus 1 NONBasic 0 B 1 2 <= 100 0
slack 2 Basic 10 C 1 0 = 70 -2
artfcl 3 NONBasic 0 Solution 70 10 780
Optimal Value (Z) 780

Basic
Cj Quantity 10 X1 8 X2 0 artfcl 1 0 surplus 1 0 slack 2 0 artfcl 3
Variables
Phase 1 - Iteration 1
1 artfcl 1 80 1 1 1 -1 0 0
0 slack 2 100 1 2 0 0 1 0
1 artfcl 3 70 1 0 0 0 0 1
zj 150 -2 -1 1 1 0 1
cj-zj 2 1 0 -1 0 0
Iteration 2
1 artfcl 1 10 0 1 1 -1 0 -1
0 slack 2 30 0 2 0 0 1 -1
0 X1 70 1 0 0 0 0 1
zj 10 0 -1 1 1 0 3
cj-zj 0 1 0 -1 0 -2
Iteration 3
0 X2 10 0 1 1 -1 0 -1
0 slack 2 10 0 0 -2 2 1 1
0 X1 70 1 0 0 0 0 1
zj 0 0 0 2 0 0 2
cj-zj 0 0 -1 0 0 -1
Phase 2
8 X2 10 0 1 1 -1 0 -1
0 slack 2 10 0 0 -2 2 1 1
10 X1 70 1 0 0 0 0 1
zj 780 10 8 -8 8 0 -2
cj-zj 0 0 8 -8 0 2

You might also like