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
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
Use the skills that you have learned in Photoshop to create the following images that could be used in your upcoming web project. All images should be cohesive and complement each
why first generation computers are better than fourth generation computers
123 is not valid in which base value
Programming Project You will implement 2 algorithms to solve the single source shortest paths problem, Bellman-Ford Algorithm and Dijkstra''s algorithm Allowed programming languag
Question 1 Bring out the advantages of Linux Operating systems Question 2 Match the Symbols with their respective file types Symbol File N
1. What actions need to be taken when a program terminates or a process is killed? What if that process destruction is not the consequence of normal termination, but rather is the
Uninformed Search Strategies: To be able to undertake a regular search, our entire agent ought to know is the starting state, the possible operators and how to check whether th
input is n positive numbers and reverse it, out put gv the absolute difference and give the reverse(magic number),using function reverseinteger, and function generate magicnumber
The Scheduling algorithms can be divided into two parts with respect to how they deal with clock interrupts. 1) Nonpreemptive Scheduling: A scheduling
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