Scribd
Upload
22 views2 pages

Assignment - 4 Prof - Ramkrishna-1

Uploaded by

saran03cdac
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
22 views2 pages

Assignment - 4 Prof - Ramkrishna-1

Uploaded by

saran03cdac
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

Mathematical Foundations for Data Science

Assignment 4
Submission Deadline: 25 Dec 2024

1. Solve the following linear programming problem using the simplex method:

max z = 2x1 + 3x2


Subject to:
x1 + x2 ≤ 4,
x1 ≤ 2,
x1 , x2 ≥ 0.
2. Formulate the dual of the following linear programming problem:

min C = 5y1 + 8y2


Subject to:
2y1 + 3y2 ≥ 7,
4y1 + y2 ≥ 5,
y1 , y2 ≥ 0.
3. Solve the following linear programming problem graphically:

max z = 3x1 + 4x2


Subject to:
x1 + x2 ≤ 4,
x1 ≤ 3,
x2 ≤ 2,
x1 , x2 ≥ 0.
4. Write the standard form of the following linear programming problem and identify its objective,
constraints, and decision variables:

max z = 3x1 + 5x2


Subject to:
2x1 + x2 ≤ 8,
x1 + 2x2 ≤ 10,
x1 , x2 ≥ 0.
5. Determine the feasible region for the following system of inequalities graphically:
1. 2x + y ≤ 10
2. 4x + y ≤ 12
3. x≥0
4. y≥0

1
(a) Write the x- and y-intercepts of each line in a table, in the format of points (e.g., (x, 0) and
(0, y)).
(b) Draw a clearly labeled graph that includes:
• The boundary lines.
• The feasible region, shaded and labeled appropriately.
(c) Clearly identify the feasible region on the graph.

6. Convert the following linear program to standard form:

max cT x + dT y
Subject to:
A1 x ≤ b1 , A2 x + B2 y ≤ b2 , l ≤ y ≤ u,
where there are no explicit bounds on x.
7. Consider the inequality-constrained linear program defined by:

min 3x1 + x2 + x3
subject to:
2x1 + x2 + x3 ≥ 2, (1)
x1 + x2 + x3 ≥ 1, (2)
and
x1 , x2 , x3 ≥ 0. (3)
8. Consider the following primal linear programming problem:

max z = 4y1 + 5y2 + 23y3 + 24y4


subject to:
y1 + 2y3 + y4 ≤ 7 (1)
y2 + y3 + 3y4 ≤ 6 (2)
y1 , y2 , y3 , y4 ≥ 0 (3)
Solve the dual problem. Show that the optimal solution is same for the primal and the dual problem.
9. The following maximization problem is not in standard form. Which of the following changes would
make the linear programming problem a standard form maximization problem?

max P = 2x + 9y
Subject to:
3x + 5y ≥ 3
9x + 5y ≤ 8
x ≥ 0, y≥0

• A. Change 9x + 5y ≤ 8 to 9x + 5y ≥ 8
• B. Change Maximize P = 2x + 9y to Minimize P = 2x + 9y
• C. Remove x ≥ 0, y ≥ 0
• D. Change 3x + 5y ≥ 3 to 3x + 5y ≤ 3
• E. None of the above changes would allow us to use the simplex method.

You might also like