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
what are the different types
Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment
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
In your own words, describe the special cases of integer programming and binary programming: what makes these problems different? Give an example of each, pointing out why they mus
full detailor theory on graphical method
What are the features of Operations Research?
Choose a publicly traded company (NYSE, AMX, or OTC) that interests you. If you don't know how to choose a company, think of IBM, DELL computer, Nike, Apple computer, GM, Ford, Nok
Anthology or Book with Articles or Works by Many Authors The name of the person compiling the book will be given followed by the word editor. For more than one edit
You are a manager at a medium sized manufacturing operation that sells a customized product directly to the consumers and the data pattern is linear but it can have the occasion ra
#question.Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0.
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd