Scribd
Upload
59 views2 pages

Homework 03 (20171025)

This document provides instructions for homework assignments on optimization using linear programming and the simplex method. It includes 5 problems: 1) use the simplex method to find optimal solutions to a given linear program, 2) solve another given linear program, 3) solve 3 linear programs using the two-phase simplex method, 4) analyze an example of cycling in the simplex method, and 5) prove an inequality related to the simplex method.

Uploaded by

Peng Hsin Hsiang
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
59 views2 pages

Homework 03 (20171025)

This document provides instructions for homework assignments on optimization using linear programming and the simplex method. It includes 5 problems: 1) use the simplex method to find optimal solutions to a given linear program, 2) solve another given linear program, 3) solve 3 linear programs using the two-phase simplex method, 4) analyze an example of cycling in the simplex method, and 5) prove an inequality related to the simplex method.

Uploaded by

Peng Hsin Hsiang
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/ 2

Introduction to Optimization

Homework #3 Due Wednesday, October 25

1. Use the simplex method to describe all the optimal solutions of the following problem.
Maximize 2 + 3 + 5 + 4
s.t. +2 +3 + 5
+ +2 +3 3
, , , 0.

2. Solve the following LP problem.


Maximize +3
s.t. 2 + 2 10
3 2 + 10
3 + 10
, , 0.

3. Solve the following problems by the two-phase simplex method:


(a)
Maximize 3 +
s.t. 1
3
2 + 4
, 0.
(b)
Maximize 3 +
s.t. 1
3
2 + 2
, 0.
(c)
Maximize 3 +
s.t. 1
3
2 2
, 0.
4. Consider the following dictionaries in a cycling example.
The initial dictionary:
= 0 0.5 + 5.5 + 2.5 09
= 0 0.5 + 1.5 + 0.5 00
= 1 0.0 + 3.5 0.5
= 0 + .10 .57 0.9 24 .
After the first iteration:
Dictionary D:
= 0 .11 + 5.5 .18 02
= 0 0.4 1.2 + 0.8 + 00
= 1 .11 3.5 + .18 + 02
= 0+. . .53 + .41 204 20 .


After the fifth iteration:
Dictionary D*:
= 09 +4 8 2
=0 0. 5 + 1.5 + 0.5
= 1 0. 5 + 0.2 0.4
= 1 + .24 + 22 293 21 .

Let B be the index set of the basic variables in D, and let B* be the index set of the basic
variables in D*. At the first iteration, let be the entering variable, while is obviously the
leaving variable. Therefore, = , = = = 0, = 11 , = 4 , = 1 11 ,
= 53 . Verify that at Dictionary D*, = 53 if in D* are substituted by in D and

= 0 " .

5. For a maximization problem, let D denote a dictionary in which # leaves the basis and $
will enter the basis.
%: ' = (' ) *' -"
,

%: = .+ ) -"
,
where " is the index set of basis variables in %, and / " and ".

Now let % be a dictionary in which # enters the basis.


% : ' = (' ) *' - "
,

%: = . + ) -"
,

Show # *#$ > 0. (Hint: you need to show # > 0 and *#$ > 0)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy