Embibe Experts Solutions for Chapter: Linear Programming Problems, Exercise 1: MHT-CET 2017

Author:Embibe Experts

Embibe Experts Mathematics Solutions for Exercise - Embibe Experts Solutions for Chapter: Linear Programming Problems, Exercise 1: MHT-CET 2017

Attempt the free practice questions on Chapter 13: Linear Programming Problems, Exercise 1: MHT-CET 2017 with hints and solutions to strengthen your understanding. EMBIBE CHAPTER WISE PREVIOUS YEAR PAPERS FOR MATHEMATICS solutions are prepared by Experienced Embibe Experts.

Questions from Embibe Experts Solutions for Chapter: Linear Programming Problems, Exercise 1: MHT-CET 2017 with Hints & Solutions

MEDIUM
MHT-CET
IMPORTANT

The maximum value of 2x+y subject to 3x+5y26 and 5x+3y30, x0, y0 is: 

EASY
MHT-CET
IMPORTANT

The objective function of LPP defined over the convex set attains its optimum value at

HARD
MHT-CET
IMPORTANT

The maximum value of z=6x+8y subject to x-y0, x+3y12, x0, y0 is

EASY
MHT-CET
IMPORTANT

For L. P. P, maximize z=4x1+2x2 subject to 3x1+2x29,x1-x23,x10,x20 has ….

HARD
MHT-CET
IMPORTANT

The objective function Z=4x1+5x2, subject to 2x1+x27, 2x1+3x215, x23 & x1,x20 has minimum value at the point