The corner points of the feasible region for a Linear Programming problem are P(0,5),Q(1,5),R(4,2) and S(12,0).

Question

The corner points of the feasible region for a Linear Programming problem are P(0,5),Q(1,5),R(4,2) and S(12,0).

The corner points of the feasible region for a Linear Programming problem are P(0,5),Q(1,5),R(4,2) and S(12,0). The minimum value of the objective function Z = 2x + 5y is at the point.

(a) P

(b) Q

(c) R

(d) S

Monjur Alahi

4 views

2025-01-04 04:42

1 Answers

Related Questions

Of all the points of the feasible region, the optimal value ofz obtained at the point lies _______.

2 Answers 5 Views

Feasible region is the set of points which satisfy _______.

2 Answers 4 Views

The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are _______.

2 Answers 6 Views

The corner points of the feasible solution are (0, 0), (2, 0), (12/7, 3/7), (0, 1). Then z = 7x + y is maximum at _______.

2 Answers 4 Views

If the corner points of the feasible solution are (0, 0), (3, 0), (2, 1) and (0, 7/3), the maximum value of z = 4x + 5y is _______.

2 Answers 4 Views

If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0) then the point of minimum z = 3x + 2y is _______.

2 Answers 4 Views

The corner points of the feasible region determined by the following system of linear inequalities: `2x+yge10, x+3yle15,x,yge0` are `(0,0),(5,0),(3,4)

2 Answers 4 Views

If the corner points of the feasible region are A (0,10),B(12,6),C(20,0) and O(0,0), then which of the following is true?

2 Answers 4 Views

The corner points of the feasible region determined by a set of constraints (linear inequalities) are P(0,5), Q(3,5), R(5,0) and S(4,1)

2 Answers 12 Views

Labour Problem, Marketing problem, Problem of transport, Domestic problem

2 Answers 4 Views

Salim Ahmed Kawsar · Accepted Answer · 2023-02-05T15:29:48+06:00

Salim Ahmed Kawsar

Option : (c) R

4 views Answered 2023-02-05 15:29