Embibe Experts Solutions for Chapter: Linear Programming, Exercise 1: Exercise
Embibe Experts Mathematics Solutions for Exercise - Embibe Experts Solutions for Chapter: Linear Programming, Exercise 1: Exercise
Attempt the free practice questions on Chapter 12: Linear Programming, Exercise 1: Exercise with hints and solutions to strengthen your understanding. Mathematics Crash Course (Based on Revised Syllabus-2023) solutions are prepared by Experienced Embibe Experts.
Questions from Embibe Experts Solutions for Chapter: Linear Programming, Exercise 1: Exercise with Hints & Solutions
A manufacturer has employed skilled men and semi-skilled men and makes two models and of an article.The making of one item of model requires hours work by a skilled man and hours work by a semi-skilled man. One item of model requires hour by a skilled man and hours by a semi-skilled man.No man is expected to work more than hours per day. The manufacturer's profit on an item of model is and on an item of model is . How many of items of each model should be made per day in order to maximize daily profit Formulate the above and solve it graphically and find the maximum profit.

A factory manufactures two types of screws and . Each type of screw requires the use of two machines automatic and a hand operated. It takes minutes on automatic and minutes on hand operated machines to manufacture a package of screws while it takes minutes on automatic and minutes on hand operated machine to manufacture a package of screws . Each machine is available for at the most hours on any day. The manufacturer can sell a package of screws at a profit to paise and screw at a profit of . Assuming that he sells all the screws he manufactures, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.

Minimize
subject to the constraints, , .

Minimize
subject to the constraints, , .

Maximize
Subject to the constraints, .

A company produces two types of goods, and , that require gold and silver. Each unit of type requires of silver and of gold, while that of type requires of silver and of gold. The company can use at the most of silver and of gold. If each unit of type brings a profit of and that of type , then find the number of units of each type that the company should produce to maximise profit.
Formulate the above LPP and solve it graphically. Also, find the maximum profit.

A furniture trader deals in only two items - chairs and tables. He has rupees to invest and a space to store at most items. A chair costs him rupees and a table costs him rupees . The trader earns a profit of rupees and rupees on a chair and table, respectively. Formulate the above problem as an LPP to maximise the profit and solve it graphically.

Solve the linear programming problem graphically:
Maximize subject to the constraints
