1. A toy company manufactures two types of dolls, a basic version doll-A and a deluxe version doll-B. Each doll of type B takes twice as long to produce as one of type A, and the company would have time to make maximum of 1000 per day. The supply of plastic is sufficient to produce 1000 dolls per day(both A & B combined). The deluxe version requires a facny dress of which there are only 500 per day available. If the company makes a profit of Rs 3.00 and Rs 5.. per doll, respectively on doll A and B, then how many of each doll should be produced per day in order to maximise the total profit. Formulate this problem.

Ans.

Let x1 and x2 be the number of dolls produced per day of type A and B respectively.

Let the doll A require “t” hrs to make.
So the doll B would require “2t” hours to make.
So the total time to manufacture x1 & x2 dolls should not exceed 1000 per day. Therefore,
x1 + 2x2 ≤ 1000 (time constrain).
Other constrains are:
x1 + x2 ≤ 1000 (Plastic constrain).
x2 ≤ 500 (Dress constrain).
And the non-negative constrains are
x1 ≥0, x2 ≥0

Maximize the profit function:
p = 3x1 + 5x2

2. What are the advantages of Linear programming techniques?

Ans. Advantages—

1. The linear programming technique helps to make the best possible use of available productive resources (such as time, labour, machines etc.)

2. It improves the quality of decisions. The individual who makes use of linear programming methods becomes more objective than subjective.

3. It also helps in providing better tools for adjustment to meet changing conditions.

4. It highlights the bottlenecks in the production processes.

5. As the problem is linear in nature the computational power required is less compared to non-linear methods. Therefore, large problems like optimization of an entire refinery can be performed using LP technique using desk top computers.

4) Draw the minimum number of straight lines needed to cover all zeros. Since three lines suffice, the solution is not optimal. (There are four operators, i.e. O1, O2, O3 and O4 to be assigned so need minimum four line)

...[pic]
ASSIGNMENT SUBMISSION AND ASSESSMENT
_________________________________________________________________________
OUMM3203
PROFESSIONAL ETHICS
(PLEASE EDIT WHERE NECESSARY-THIS IS ONLY SUGGESTIONS FOR THE ASSIGNMENT’S GENERAL INSTRUCTIONS)
_________________________________________________________________________
INSTRUCTIONS TO STUDENTS
1. This assignment contains only ONE (1) question that is set in the language of the printed module for the...

...declared but is not set to a definite known value before it is used.
Algorithm workbench
3. Write assignment statements that perform the following operations with the variables a, b, and c.
a. Adds 2 to a and stores the result in b
b. Multiplies b times 4 and stores the result in a
c. Divides a by 3.14 and stores the result in b
d. Subtracts 8 from b and stores the result in a
Assignment statements that perform operations with the variables a, b, and c*...

...international assignments continue to be important for employers and employees alike.
• In particular, the emergence of markets such as China, India and Eastern Europe has had led to an increasing demand for managers with distinctive competences to manage in these countries. (Collings et al, 2006)
• However, the context has altered and traditional models do not take into account quick-to-market demand and cost-effective deployment or enable increased cross-border volume for...

...PT1420 - Unit 5 Homework and Lab Assignment
Unit 5 Assignment 1: Homework
1.) Design an if-then statement that assigns 20 to the variable y and assigns 40 to the variable z if the variable x is greater than 100. (Simple if statement)
If x > 100 then
Y=20
Z=40
End if
2.) Design an if-then statement that assigns 0 to the variable b and assigns 1 to the variable c if variable a is less than 10. (Simple if statement)
3.) Design an if-then-else...

...A Special Multi-Objective Assignment Problem Author(s): D. J. White Source: The Journal of the Operational Research Society, Vol. 35, No. 8 (Aug., 1984), pp. 759767 Published by: Palgrave Macmillan Journals on behalf of the Operational Research Society Stable URL: http://www.jstor.org/stable/2581982 . Accessed: 19/04/2013 03:45
Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at ....

...
Chartered Management Institute Approved Centre
Level 5 Extended Diploma in Management and Leadership
Written Assessment – 5
Unit 5001V1
Instruction Sheet
Assignment: Unit 5001V1 – Personal development as a manager and leader
Level: 5
Lecturer: Ian Laing
Date of Issue: 13th May 2015
Date Due In: 26th June 2015
Format: Word Document submitted to:
ianlaing@ihlassociates.karoo.co.uk...

...adapting to the need of the global market.
Industrial management holds solutions for many problems the market offers with many tools, including the 'Hungarian Algorithm'.
The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time that's anticipated later primal-dual methods. The algorithm was developed and published by Harold Kuhn in 1955, who gave the name 'Hungarian Method' because the algorithm was largely based on...

...CHAPTER 6:
TRANSPORTATION, TRANSSHIPMENT AND ASSIGNMENT PROBLEMS
Transportation Problem
- A distribution-type problem in which supplies of goods that are held at various locations are to be distributed to other receiving locations.
- The solution of a transportation problem will indicate to a manager the quantities and costs of various routes and the resulting minimum cost
- Used to compare location alternatives in deciding where to locate factories and warehouses to...