DMOR-04-02

# DMOR-04-02 - UF-ESI-6314DMOR-04-02 Problem Statementpage 1...

This preview shows pages 1–4. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: UF-ESI-6314DMOR-04-02.xls Problem Statementpage 1 of 704-02.Use the simplex method to find the optimal solution to the following problem. Use x1and x3 as your initial basic variables. (This means you need to do a little Gauss-Jordan work before you can begin the simplex method.)minimize:z = x1– 3x2+ x3– x4subject to:1x1– 1x2+ 1x3+ 2x4= 15–2x1+ 1x2+ 1x3– 1x4= x1>x2>x3>x4>Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435UF-ESI-6314DMOR-04-02.xls Standard Formpage 2 of 7Begin by recasting these equations into standard form.maximize:1z' + 1x1– 3x2+ 1x3– 1x4= 0subject to:0z' + 1x1– 1x2+ 1x3+ 2x4= 150z' – 2x1+ 1x2+ 1x3– 1x4= x1>x2>x3>x4>This system has m= 3 linear equations in n= 5 variables. Per the instructions of this problem, this requires setting two variables equal to zero and defining the remaining variables in those terms. Do this to prepare them for simplex modeling.Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435UF-ESI-6314DMOR-04-02.xls Tableauxpage 3 of 7These tableaux highlight the basic variable cells in light gray....
View Full Document

{[ snackBarMessage ]}

### Page1 / 7

DMOR-04-02 - UF-ESI-6314DMOR-04-02 Problem Statementpage 1...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online