Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
77 views

Assignment For Chapter Two: Operation Research

This document contains an assignment with multiple parts related to linear programming problems. Part 1 contains true-false questions about standard form in linear programming problems. Part 2 asks students to fill in blanks about slack variables, pivot elements, and constraints. Part 3 provides 10 linear programming problems to solve using the simplex method. Part 4 asks students to convert 3 minimization problems into maximization problems and solve the duals. Part 5 provides 5 word problems to model and solve using linear programming.

Uploaded by

Abdiqadir Osman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
77 views

Assignment For Chapter Two: Operation Research

This document contains an assignment with multiple parts related to linear programming problems. Part 1 contains true-false questions about standard form in linear programming problems. Part 2 asks students to fill in blanks about slack variables, pivot elements, and constraints. Part 3 provides 10 linear programming problems to solve using the simplex method. Part 4 asks students to convert 3 minimization problems into maximization problems and solve the duals. Part 5 provides 5 word problems to model and solve using linear programming.

Uploaded by

Abdiqadir Osman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

MOGADISHU

Operation Research UNIVERSITY

Assignment for Chapter two


Part One True-False Items

a) In a maximum problem written in standard form ,each of the constraints with exception
of the non-negativity constraints is written with 𝑎 ≤ symbol ( )
b) In a maximum problem written in standard form, the slack variables are sometimes
negative. ( )
c) Once the pivot element is identified in a tableau, the pivot operation causes the pivot
element to become a 1and causes the remaining entries in the pivot column to become
zeros. ( )
d) The pivot element is sometimes in the objective row. ( )
e) One way to solve a minimum problem is to first solve its dual which is a maximum
problem. ( )

Part Two: Fill in the blanks

a) The constraints of a maximum problem in standard form are changed from an inequality
to an equation by introducing______________________
b) For a maximum problem in standard form, the pivot ----------------------is located by
selecting the most negative entry in the_________________________
c) For a minimum problem to be in standard form all the constraints must be written with
_______________________signs

Instructor : Wehliye 1
MOGADISHU
Operation Research UNIVERSITY

Part Three: Solve the following linear programming problems using the simplex method.

1) Maximize z = x1 + 2x2 + 3x3


Subject to x1 + x2 + x3 ≤ 12
2𝑥1 + 𝑥2 + 3𝑥3 ≤ 18
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

2) 𝐌𝐚𝐱𝐢𝐦𝐢𝐳𝐞 𝐳 = 𝑥1 + 2𝑥2 + 𝑥3
𝑥1 + 𝑥2 ≤ 3
𝐬𝐮𝐛𝐣𝐞𝐜𝐭 𝐭𝐨
𝑥2 + 𝑥3 ≤ 4
𝑥1 + 𝑥3 ≤ 5
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

3) Maximize z = x1 + 2x2 + 3x3


Subject to x1 + x2 + x3 ≤ 12
2𝑥1 + 𝑥2 + 3𝑥3 ≤ 18
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

4) 𝐌𝐚𝐱𝐢𝐦𝐢𝐳𝐞 𝐳 = 𝑥1 + 2𝑥2 + 𝑥3
𝑥1 + 𝑥2 ≤ 3
𝐬𝐮𝐛𝐣𝐞𝐜𝐭 𝐭𝐨
𝑥2 + 𝑥3 ≤ 4
𝑥1 + 𝑥3 ≤ 5
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Instructor : Wehliye 2
MOGADISHU
Operation Research UNIVERSITY

5) 𝐌𝐚𝐱𝐢𝐦𝐢𝐳𝐞 z = 5x1 + 3x2


𝐒𝐮𝐛𝐣𝐞𝐜𝐭 𝐭𝐨 x1 + x2 ≤ 12
2x1 + x2 ≤ 16
x1 = 0; x2 ≥ 0
6) 𝐌𝐚𝐱𝐢𝐦𝐢𝐳𝐞 z = 2x1 + 3x2 + x3
𝐒𝐮𝐛𝐣𝐞𝐜𝐭 𝐭𝐨 4x1 + 2x2 + 5x3 ≤ 32
2x1 + 4x2 + 3x3 ≤ 28
x1 , x2 , x3 ≥ 0
7) Maximize z = x1 + 6x2 + 8x3
x 1 + 2x2 ≤ 1200
Subject to 2x2 + x3 ≤ 1800
4𝑥1 + 𝑥3 ≤ 3600
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
8) Maximize z = 6x1 + 8x2 + 5x3
4x1 + x2 + x3 ≤ 1800
Subject to 2𝑥1 + 2𝑥2 + 𝑥3 ≤ 2000
4𝑥1 + 2𝑥2 + 𝑥3 ≤ 3200
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
9) Maximize z = 12𝑥1 + 10𝑥2
Subject to 𝑥1 + 𝑥2 ≤ 6
2𝑥1 + 𝑥2 ≤ 8
𝑥1 = 0; 𝑥2 ≥ 0
10) 𝐌𝐚𝐱𝐢𝐦𝐢𝐳𝐞 z = 2x1 + 3x2 + x3
𝐒𝐮𝐛𝐣𝐞𝐜𝐭 𝐭𝐨 4x1 + 2x2 + 5x3 ≤ 32
2x1 + 4x2 + 3x3 ≤ 28
x1 , x2 , x3 ≥ 0

Instructor : Wehliye 3
MOGADISHU
Operation Research UNIVERSITY

11) Maximize z = x1 + 6x2 + 8x3


x 1 + 2x2 ≤ 1200
Subject to 2x2 + x3 ≤ 1800
4𝑥1 + 𝑥3 ≤ 3600
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
12) Maximize z = 6x1 + 8x2 + 5x3
4x1 + x2 + x3 ≤ 1800
Subject to 2𝑥1 + 2𝑥2 + 𝑥3 ≤ 2000
4𝑥1 + 2𝑥2 + 𝑥3 ≤ 3200
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
13) Minimize z = 12𝑥1 + 10𝑥2
Subject to 𝑥1 + 𝑥2 ≤ 6
2𝑥1 + 𝑥2 ≤ 8
𝑥1 = 0; 𝑥2 ≥ 0

Instructor : Wehliye 4
MOGADISHU
Operation Research UNIVERSITY

Part four: In problems 1-3, convert each minimization problem into a maximization problem, the
dual, and then solve by the simplex method.

1) 𝐌𝐢𝐧𝐢𝐦𝐢𝐳𝐞 z = 5x1 + 6x2 + 7x3


𝐒𝐮𝐛𝐣𝐞𝐜𝐭 𝐭𝐨 3x1 + 2x2 + 3x3 ≥ 10
4x1 + 3x2 + 5x3 ≥ 12
x1 , x2 , x3 ≥ 0
2) Minimize z = 4𝑥1 + 6𝑥2 + 7𝑥3
Subject to 𝑥1 + 𝑥2 + 2𝑥3 ≥ 20
𝑥1 + 2𝑥2 + 𝑥3 ≥ 30
x1 , x2 , x3 ≥ 0
3) Minimize z = 40𝑥1 + 48𝑥2 + 30𝑥3
Subject to 2𝑥1 + 2𝑥2 + 𝑥3 ≥ 25
𝑥1 + 3𝑥2 + 2𝑥3 ≥ 30
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Part Five: Problems


1) A diet is to contain at least 8 units of vitamins, 9 units of minerals, and 10 calories. Three
foods, Food A, Food B, and Food C are to be purchased. Each unit of Food A provides 1
unit of vitamins, 1 unit of minerals, and 2 calories. Each unit of Food B provides 2 units
of vitamins, 1 unit of minerals, and 1 calorie. Each unit of Food C provides 2 units of
vitamins, 1 unit of minerals, and 2 calories. If Food A costs $3 per unit, Food B costs $2
per unit and Food C costs $3 per unit, how many units of each food should be purchased
to keep costs at a minimum? ( Use simplex method )

Instructor : Wehliye 5
MOGADISHU
Operation Research UNIVERSITY

2) A farmer has 100 acres of land on which she plans to grow wheat and corn. Each acre of
wheat requires 4 hours of labor and $20 of capital, and each acre of corn requires 16 hours
of labor and $40 of capital. The farmer has at most 800 hours of labor and $2400 of capital
available. If the profit from an acre of wheat is $80 and from an acre of corn is $100, how
many acres of each crop should she plant to maximize her profit?
3) A factory manufactures chairs, tables and bookcases each requiring the use of three
operations: Cutting, Assembly, and Finishing. The first operation can be used at most 600
hours; the second at most 500 hours; and the third at most 300 hours.
4) A chair requires 1 hour of cutting, 1 hour of assembly, and 1 hour of finishing; a table
needs 1 hour of cutting, 2 hours of assembly, and 1 hour of finishing; and a bookcase
requires 3 hours of cutting, 1 hour of assembly, and 1 hour of finishing. If the profit is $20
per unit for a chair, $30 for a table, and $25 for a bookcase, how many units of each should
be manufactured to maximize profit?
5) A diet is to contain at least 8 units of vitamins, 9 units of minerals, and 10 calories. Three
foods, Food A, Foo d B, and Foo d C are to be purchased. Each unit of Food A provides 1
unit of vitamins, 1 unit of minerals, and 2 calories. Each unit of Food B provides 2 units of
vitamins, 1 unit of minerals, and 1 calorie. Each unit of Food C provides 2 units of vitamins,
1 unit of minerals, and 2 calories. If Foo d A costs $3 per unit, Foo d B costs $2 per unit
and Food C costs $3 per unit, how many units of each food should be purchased to keep
costs at a minimum?

Good Lucky

Instructor : Wehliye 6

You might also like