Embibe Experts Solutions for Chapter: Linear Programming, Exercise 1: Exercise 1

Author:Embibe Experts

Embibe Experts Mathematics Solutions for Exercise - Embibe Experts Solutions for Chapter: Linear Programming, Exercise 1: Exercise 1

Attempt the practice questions on Chapter 19: Linear Programming, Exercise 1: Exercise 1 with hints and solutions to strengthen your understanding. Mathematics Crash Course COMEDK UGET solutions are prepared by Experienced Embibe Experts.

Questions from Embibe Experts Solutions for Chapter: Linear Programming, Exercise 1: Exercise 1 with Hints & Solutions

HARD
COMEDK UGET
IMPORTANT

Maximum value of z equals 3x+2y subject to x+y3, x2, -2x+y1, x0, y0 is

HARD
COMEDK UGET
IMPORTANT

The shaded region in the figure is the solution set of the inequations

Question Image

HARD
COMEDK UGET
IMPORTANT

The shaded part of given figure indicates the feasible region, then the constraints are

Question Image

MEDIUM
COMEDK UGET
IMPORTANT

Which of the following is not a vertex of the positive region bounded by the inequalities 2x+3y6, 5x+3y15 and x,y0?

MEDIUM
COMEDK UGET
IMPORTANT

The graph of inequations xy and yx+3 is located in

MEDIUM
COMEDK UGET
IMPORTANT

The linear inequations for which the shaded area in the following figure is the solution set, are

Question Image

MEDIUM
COMEDK UGET
IMPORTANT

Shaded region is represented by

Question Image

EASY
COMEDK UGET
IMPORTANT

The corner points of the feasible region determined by the system of linear constraints are 0, 10, 5, 5, 15, 15, 0, 20. Let z=px+qy, where p, q>0. Condition on p and q, so that the maximum of z occurs at both the points 15, 15 and 0, 20 is