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
Communication Networks: Communication networks are made up of transmission lines, concentrators, switching mechanisms and non-data processing components. Due to increased comp
write a program of 2 sum and 2 product number in C++ programming language
sin^2*a+cos^2*a=1
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
SYMBOLS CHART Every one of the parts on code line in assembler is known as token, for instance on the code line: MOV AX, Var We comprise three tokens, the MOV instruction, the AX o
PRINCIPAL STRUCTURES IN FLOW CHARTING Structured programing calls for the usage of four principal structures to help simplify the program. They are: Sequential contro
Printers: Printers: Printers exist in a variety of forms: Line Printers: These have been widely used for many years in large computer installations. They are design
A procedure is a compilation of instructions to which we can express the flow of our program, and once the execution of these instructions is over power is given back to the next l
write about relocatable programs
tell me about vector processor
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