Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
A company manufactures 2 kinds of hats. Each hat of the I type needs twice as much as labour time as the II type. The company can manufacture a sum of 500 hats a day. The market restricts daily sales of I and II types to 150 and 250 hats. Supposing that the gain per hat is Rs.8 for type A and Rs. 5 for type B. Develop LPP models so as to find out the number of hats to be manufactured of each type so as to maximize the gain (profit).
Answer
Assume x1 - number of hats produced by type A
Assume x2 - number of hats produced by type B
Maximize Z = 8x1 + 5x2
Subject to
2x1 + x2 ≤ 500 (labour time)
x1 ≤ 150
x2 ≤ 250
x1≥0, x2 ≥0
1. Determination to enter a new territories. 2. To decide to enter a new market or not. 3. To determine how much production capacity to be builds up. 4. Helpful in
what are the limitations of north west corner method
G. Ambler has € 10000 available for a second hand car, but would like to buy a fast car that costs € 25000. He needs the money for that car quickly, and would like to increase his
difference between simplex solution procedure for maximisation and minimisation
The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch
RANGE Range is the difference between the highest and the lowest value is series. This is the simplest absolute measure of dispersion. Symbolically : R= L- S
Problem: A policy maker is considering several policy options that lead to different utility levels of different individuals a) Which Policy is would be optimal according t
INFORMATION RESOURCES - SELECTION PRINCIPLES: Selection of materials for a library requires sagacity, adroitness and attention to people's needs for everything from books and
The Association of Malawi Mechanics has commissioned a study to investigate the link between engine wear and mileage. The main focus of the study is to determine whether the mileag
Problem based on graphical solution of a given LPP when feasible region is bounded. 1. Solve the following linear programming graphically; Maximize and minimize z = 60x+
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd