Amit M Agarwal Solutions for Chapter: Linear Programming, Exercise 2: Target Exercises
Amit M Agarwal Mathematics Solutions for Exercise - Amit M Agarwal Solutions for Chapter: Linear Programming, Exercise 2: Target Exercises
Attempt the free practice questions on Chapter 15: Linear Programming, Exercise 2: Target Exercises with hints and solutions to strengthen your understanding. Complete Study Pack for Engineering Entrances Objective Mathematics Vol 2 solutions are prepared by Experienced Embibe Experts.
Questions from Amit M Agarwal Solutions for Chapter: Linear Programming, Exercise 2: Target Exercises with Hints & Solutions
A firm has to transport packages using large vans which can carry packages each and small vans which can take packages each. The cost for engaging each large van is and each small van is . Not more than is to be spent on the job and the number of large vans cannot exceed the number of small vans. Then, the minimum cost for the firm is

A manufacturer has three machines and installed in his factory. Machines and are capable of being operated for utmost hours whereas, machine must be operated for at least hours a day. She produces only two items and each requiring the use of all the three machines.
The number of hours required for producing unit of each of and on the three machines are given in the following table:
She makes a profit of and on items and , respectively,
Then, to maximise the profit, number of units of item , the manufacturer has to produce, is

Anil wants to invest utmost is bonds and . According to the rules, he has to invest at least in bond and at least in bond . If the rate of interest in bond is per annum and in bond is per annum, then to maximise the interest, the investment in bond and are respectively

The maximum value of , where subject to constraints and is

If the given constraints are and , then the maximum value of the function is

The minimum value of the objective function subject to constraints is

Reshma wishes to mix two types of food and in such a way that the vitamin contents of the mixture contain at least of vitamin and of vitamin . Food costs and food costs . Food contains of vitamin and of vitamin , while food contains of vitamin and of vitamin . Then, the minimum cost of the mixture is

The linear programming problem Maximise subject to constraints are ,
and has
