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!
Question
(a) A firm produces four products: P, Q, R, and S. Each unit of product P requires two hours of milling, one hour of assembly, and $10 worth of in-process inventory. Each unit of product Q requires one hour of milling, three hours of assembly, and $5 worth of in-process inventory. Each unit of R requires 2.5 hours of milling, 2.5 hours of assembly, and $2 worth of in-process inventory. Finally, each unit of product S requires five hours of milling, no assembly, and $12 of in-process inventory.
The firm has 120 thousand hours of milling time and 160 thousand hours of assembly time available. In addition, not more than $1 million may be tied up in in-process inventory.
Each unit of product P returns a profit of $40; each unit of Q returns a profit of $24; each unit of product R returns a profit of $36; and each unit of product S returns a profit of $23. Not more than 20 000 units of product P can be sold; not more than 16 000 units of product R can be sold; and any number of units of products P and S may be sold. However, at least 10 000 units of product S must be produced and sold to satisfy a contract requirement.
The objective of the firm is to maximize the profit resulting from the sale of the four products. Formulate the above as a linear programming problem.
(b) Use the simplex method to maximize
z = x1 + x2
subject to
x1 + 5x2 ≤ 5
2x1 + x2 ≤ 4
with
x1, x2 ≥ 0
Evolution of ERP The origin of using computers for business, traces the following line of story. Originally, they were designed to support the repetitive and time consuming fu
Create systems flow chart and state tranistion diagram for online placement and consultancy
Multiprocessor DSP Systems Over modern times several organizations have provided forums made up of several DSPs. More lately, semiconductor organizations have been providing sn
Perverse software: Perverse software is a program which causes hindrances in other programs execution in such a way resulting in modification or complete destruction of data w
board coloring
Iterative Deepening Search- Artificial intelligence: So, breadth first search is guaranteed to find a solution (if one exists), but it grape whole memory. However, Depth first
QUESTION (a) Write down the Update Step in the Dijkstra's algorithm explaining its complexity. (b) Propose a Generic Algorithm for Depth-First Search Algorithm, assuming
There are two kinds of procedures, the intrasegments, which are found on the similar segment of instructions and the inter-segments which can be stored on dissimilar memory segment
QUESTION (a) Compare the adapter pattern with the façade and decorator patterns. (b) Illustrate a two-way adapter pattern. (c) Describe 3 components of a pattern. (d)
Each Many to Many relationship type maps into the Table. The primary key of this relevant is the combination of the primary keys of the participating entity types. These are also c
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