D.P. GUPTA, Preetima Bajpai and, Sanjeev Kumar Jha Solutions for Chapter: Linear Programming, Exercise 1: Exercise 1
D.P. GUPTA Mathematics Solutions for Exercise - D.P. GUPTA, Preetima Bajpai and, Sanjeev Kumar Jha Solutions for Chapter: Linear Programming, Exercise 1: Exercise 1
Attempt the free practice questions on Chapter 19: Linear Programming, Exercise 1: Exercise 1 with hints and solutions to strengthen your understanding. Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams solutions are prepared by Experienced Embibe Experts.
Questions from D.P. GUPTA, Preetima Bajpai and, Sanjeev Kumar Jha Solutions for Chapter: Linear Programming, Exercise 1: Exercise 1 with Hints & Solutions
The maximum value of subject to constraints and is

A wholesale merchant wants to start the business of cereal with Wheat is per quintal and rice is per quintal. He has capacity to store quintal cereal. He earns the profit per quintal on wheat and per quintal on rice. If he store quintal rice and quintal wheat, then for maximum profit, the objective function is

The value of objective function is maximum under linear constraints is

The feasible solution of a L.P.P. belongs to

In L.P.P., the constraints form

The graph of inequations and is located in

A linear programming problem of linear functions deals with

The number of corner points of the Max subject to the constraints are
