Linear Programming

Get insights from 59 questions on Linear Programming, answered by students, alumni, and experts. You may also ask and answer any question you like about Linear Programming

  • 59

    Questions

  • 0

    Discussions

  • 0

    Active Users

  • 0

    Followers

Have a question about Linear Programming? Ask our experts

Ask Your Question

Keep it short & simple. Type complete word. Avoid abusive language.

New answer posted•a year ago
S
a year ago

Let the manufacturer produce x packages of nuts and y packages of bolts. Therefore,

x ≥ 0 and y ≥ 0

The given information can be compiled in a table as follows.

 

Nuts

Bolts

Availability

Machine A (h)

1

3

12

Machine B (h)

3

1

12

The profit on a package of nuts is Rs 17.50 and on a package of bolts is Rs 7. Therefore, the constraints a

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

(i) Let the number of rackets and the number of bats to be made be x and y respectively.

The machine time is not available for more than 42 hours.

∴1.5x+3y≤42....(1)

The craftsman’s time is not available for more than 24 hours.

∴3x+y≤24             ......(2)

The factory is to work at full capacity. Therefore,

1.5x + 3y = 42

3x + y = 24

On solving these equati

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Let there be x cakes of first kind and y cakes of second kind. Therefore,

x ≥ 0 and y ≥ 0

The given information can be complied in a table as follows.

 

Flour (g)

Fat (g)

Cakes of first kind, x

200

25

Cakes of second kind, y

100

50

Availability

5000

1000

∴200x+100y≤5000⇒2x+y≤5025x+50y≤1000⇒x+2y≤40

Total numbers of cakes, Z, that can be made are, Z= x + y

The mathematical formulation of the given problem is

Maximize&nb

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Let the mixture contain x kg of food P and y kg of food Q. Therefore, x ≥ 0 and y ≥ 0

The given information can be compiled in a table as follows.

 

Vitamin A (units/kg)

Vitamin B (units/kg)

Cost (Rs/kg)

Food P

3

5

60

Food Q

4

2

80

Requirement (units/kg)

8

11

 

The mixture must contain at least 8 units of vitamin A and 11 units of vitamin B. Therefore, the constraints are

3x + 4y ≥ 8 

5x + 2y ≥ 11 

Total cost, Z, of purchasing

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Maximise z=x+y , subject to x−y≤−1, −x+y≤0, x, y≥0

The corresponding equation of the given inequalities are

x−y=1 x−1+y1=1

−x+y=0 ⇒ x=y

x, y=0 x, y=0

The graph of the given inequalities is shown.

There is no common point in the two shaded region. Thus, there is no feasible region.

∴ Z has no maximum value.

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Maximise z=−x+2y , subject to the constraints

x≥3, x+y≥5, x+2y≥6, y≥0.

The corresponding equation of the given inequalities are

x=3 x=3

x+y=5 ⇒x5+y5=1

x+2y=6 x6+y3=1

y=0 y=0

The graph of the given inequalities is shown

The feasible region unbounded.

The values of Z at corner points A (6,0), B (4,1), and C (3,2) are as follows

As the feasible regio

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Minimize and Maximise z=x+2y

Subject to x+2y≥100, 2x−y≤0, 2x+y≤200, x, y≥0

The corresponding equation of the given inequalities are

x+2y=100 ⇒x100+y50=1

2x−y=0 2x=y

2x+y=200 x100+y200=1

x, y≥0 x, y=0

The graph of the inequalities is shown below.

The shaded bounded region ABCD is the feasible region with the corner points.

A (0,50), B, (20,40), C (50,100), D (0,200)

The values o

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Minimize and Maximise z=5x+10y

Subject to x+2y≤120, x+y≥60, x−2y≥0, x, y≥0

The corresponding equation of the given inequalities are

x+2y=120x+y=60x−2y=0x, y=0

⇒x120+y60=120

x60+y60=1x=2yx, y=0

The graph of the inequalities in shown.

The shaded founded region ABCD is the feasible region with the corner points A (60, 0), B (120, 0), C (60, 30)&D (40, 20)

The value of Z a these corner points are

The minimum value of Z is 300 at (60,0)

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Minimize z=x+2y

Subject to 2x+y≥3, x+2y≥6, x, y≥0

The corresponding equation of the given inequalities are

2x+y=3x+2y=6x, y≥0

⇒x32+y3=1

x6+y3=1

x, y≥0

The feasible region is unbounded the corner point are A (6,0), B (0,3)

The value of Z at these corner points are follows.

Since, the feasible region is unbounded, a graph of x+2y<6 is drawn.

Also since there is no

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Maximum z=3x+2y

Subject to x+2y≤10, 3x+y=≤15, x, y≥0

The corresponding equation of the given inequalities are :

x+2y=103x+y=15x, y=0

⇒x10+y5=1

x5+y5=1x, y=0

The graph of the given inequalities

The shaded bounded region OABC in the feasible region with the corner points

O (0, 0), A (5, 0), B (4, 3), C (0, 5)

The value of Z at these points are given below.

Therefore, the maximum value of Z is 18 at point (4,3).

Thumbs Up IconUpvote Thumbs Down Icon