Scribd
Upload
7 views1 page

Hands-On Tutorial N°2: Min Z 2x1 x2 SBJ 2x1 3x2 - 2 4x1

Uploaded by

adelpepl الجديد
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
7 views1 page

Hands-On Tutorial N°2: Min Z 2x1 x2 SBJ 2x1 3x2 - 2 4x1

Uploaded by

adelpepl الجديد
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

University of Mohamed El Bachir El Ibrahimi Computer Science Department

Subject: Linear programming 3rd years SI (2024-2025)

Hands-on tutorial N°2


Question 1:
Reformulate the following linear programs in canonical form (max):
1- Min Z= 2x1 – x2

sbj 2x1 – 3x2 = - 2

4x1 – x2 ≤ 3

x1, x2≥ 0

2- Max Z= x1 – 2x2 -x4

sbj x1 + x2 +x3 +2x4 = 3

2x1 – x2 + 5x3 = - 6

3x1 + 2x2 – 3x4 ≥ 2

x1 ϵ R ,x2, x3, x4 ≥ 0

Question 2:
Give the standard form of the following linear program:
Max Z= 2x1 – 3x2

Sbj 2x1 + x2 ≤ K (K ϵ R)

4x1 +3x2 ≤ 3
x1 + 3x2 ≥ 4

x1 ≥ 0 , x2 ϵR
Question 3:
Consider the following linear program:

Max Z= 3x1 + x2 + 2x3


x1 - x2 + x3 ≤ 3
3x1 + 2x2 + x3 ≤ 9
2x1 + x2 + 2x3 ≤ 6
x1≥0, x2≥0, x3≥0
- 1) Test the optimality of each of the following three bases: B1={4,5,6}, B2={3,5,6}, B3{2,3,4},
What can we conclude.

You might also like