0% found this document useful (0 votes)
46 views1 page

Assignment Optimization

The document contains 4 optimization problems: 1) maximizing profit from 2 products with 3 processes, 2) graphically solving a LP to find feasible and infeasible extreme points, 3) using the simplex method to find the optimum of a LP with 4 variables, 4) forming the dual of a LP and finding its optimum solution.

Uploaded by

mohammed ali
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
0% found this document useful (0 votes)
46 views1 page

Assignment Optimization

The document contains 4 optimization problems: 1) maximizing profit from 2 products with 3 processes, 2) graphically solving a LP to find feasible and infeasible extreme points, 3) using the simplex method to find the optimum of a LP with 4 variables, 4) forming the dual of a LP and finding its optimum solution.

Uploaded by

mohammed ali
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/ 1

Zagazig University, Faculty of Engineering Specialization : Mechatronics

Course Name : Computer Apps. in Mechatronics No. of pages : 1


Course Code : MEC 401 Assignment in Optimization No. of Questions : 4

1- A company which operates 10 hours a day manufactures two products on three sequential
processes. The following table summarizes the data of the problem:
Minutes per unit
Product Process 1 Process 2 Process 3 Unit profit
1 10 6 8 $2
2 5 20 10 $3
Formulate the problem as a linear program to find the optimal mix of the two products in
order to maximize the total return.

2- Consider the following LP problem:


Maximize z = 5x1 + 4x2
Subject to:
6x1 + 4x2 ≤ 24
x1 + 2x2 ≤ 6
-x1 + x2 ≤ 1
x2 ≤ 2
x1 ≥ 0, x2 ≥ 0
(a) Determine the solution space graphically.
(b) Identify all the feasible and infeasible extreme points of the solution space.
(c) Find the optimum solution from the solution space.

3- Determine the optimum solution for the following LP problem using simplex method:
Minimize z = 5x1 - 4x2 + 6x3 - 8x4
subject to;
x1 + 2x2 + 2x3 + 4x4 ≤ 40
2x1 – x2 + x3 + 2x4 ≤ 8
4x1 – 2x2 + x3 – x4 ≤ 10
x1, x2, x3, x4 ≥ 0
- Verify your solution using TORA software.

4- Form the dual problem for the following primal LP problem:


Minimize w = 16 x1 + 9 x2 + 21 x3
subject to;
x1 + x2 + 3x3 ≥ 12
2x1 + x2 + x3 ≥ 16
x1 , x2 , x3 ≥ 0
- Then find the optimum solution of the dual problem using either TORA software or
Solver Add-in of Microsoft Excel.

You might also like