Scribd
Upload
92 views2 pages

MTL103 Practice Sheet 1

This document contains 14 problems related to linear programming (LP). Some of the problems involve graphically solving LP problems to find optimal values or determine feasibility. Other problems involve analyzing properties of LP problems, such as proving results about optimality, convexity, and basic feasible solutions.

Uploaded by

Sreemanti Dey
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
92 views2 pages

MTL103 Practice Sheet 1

This document contains 14 problems related to linear programming (LP). Some of the problems involve graphically solving LP problems to find optimal values or determine feasibility. Other problems involve analyzing properties of LP problems, such as proving results about optimality, convexity, and basic feasible solutions.

Uploaded by

Sreemanti Dey
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

MTL 103: Practice Sheet 1

1. If S = {(x, y) : −x + y ≤ 4, 3x − 2y ≤ 9, x, y ≥ 0}, solve graphically the following problems:


(a) max x - 5y over S (b) max 6x + 4y + 18 over S

2. Solve max F (x, y) = x + 10y over the solutions set of

min f (x, y) = y
s.t. − 5x + 4y ≤ 6
x + 2y ≤ 10
2x − y ≤ 15
2x + 10y ≥ 15
x, y ≥ 0

3. Solve max z = min (3x − 10, −5x + 5), 0 ≤ x ≤ 5.

4. Suppose we want to show that all solutions of x + y ≤ 4; 2x − 3y ≤ 6; x, y ≥ 0 also satisfy


x + 2y ≤ 8. Formulate this problem as an LP and verify your result.

5. Solve
max f (x, y) = 2x + y
min f (x, y) = 5x + 2y
s.t. 0 ≤ x ≤ 2
s.t. x + 4y ≥ 4
x+y ≤3
5x + 2y ≥ 10
x + 2y ≤ 5
x, y ≥ 0
y≥0
6. Consider the following LP

max z = x1 − 4x2
s.t. x1 − x2 ≥ −4
4x1 + 5x2 ≤ 45
5x1 − 2x2 ≤ 20
x1 ≥ 0.

Describe the range set of x2 for which the LP (a) becomes unbounded; (b) infeasible.

7. For any non-zero cost vector c = (c1 , c2 ), can x∗ = (1, 3) be an optimal solution of the
problem given below.

max c1 x1 + c2 x2
2x1 + 3x2 ≤ 11
3x1 − 2x2 ≤ 9
x1 , x2 ≥ 0.

Solve the LPP graphically when c = (1, 5), and find the optimal value of the LP.
8. Show that if an LP has more than one optimal solution then it has infinitely many solutions.

9. Prove that the set of all convex combinations of a finite number of L.I. vectors is a convex
set.

10. Find the extreme directions (if any) and extreme points of the set described by {(x1 , x2 ) :
5x1 + 3x2 ≥ 15, −x1 + x2 ≤ 1, 5x1 − 6x2 ≥ −30, x1 , x2 ≥ 0}.

11. Find the extreme points and extreme directions of the set

−3x1 + x2 ≤ −2
−x1 + x2 ≤2
−x1 + 2x2 ≤8
x1 ≥ 0, x2 ≥2

12. If Ax = b, A : m × n, ρ(A) = m, has a solution which involves precisely m non-zero variables


and if this solution is unique, then prove that it must be a basic solution.

13. Find the number of degenerate and non-degenerate basic feasible solutions for the system
graphically
2x + 3y ≤ 21; 3x − y ≤ 15; x + y ≥ 5; y ≤ 5; x, y ≥ 0.

14. Find all basic solutions of


(a) x1 + 2x2 + 3x3 + 4x4 = 7, 2x1 + x2 + x3 + 2x4 = 3
(b) 8x1 + 6x2 + 12x3 + x4 + x5 = 6, 9x1 + x2 + 2x3 + 6x4 + 10x5 = 11

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