Formulate linear programming problem, Basic Computer Science

Assignment Help:

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


Related Discussions:- Formulate linear programming problem

COMPUTER SYSTEM ARCHITECTURE, PLEASE HELP ME TO CONSTRUCT THE XOR GATE USIN...

PLEASE HELP ME TO CONSTRUCT THE XOR GATE USING ONLY NAND GATE

MIDI, Explain about MIDI audio

Explain about MIDI audio

Programming Project 1, Programming Project You will implement 2 algorithms...

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

Assignment, Hi I have an assignment can you help me ?

Hi I have an assignment can you help me ?

Cryptography, Consider the one-time pad encryption scheme to encrypt a 1-bi...

Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the event "message

Circuit switching and , Circuit Switching: Many switching techniques a...

Circuit Switching: Many switching techniques are in use. One of them is line or circuit switching in which a communications path is actually established before the message is

Acting Rationally - artificial intelligence, Acting Rationally: Al Capo...

Acting Rationally: Al Capone was finally convicted for tax evasion. Were the police acting rationally? To answer this, we must first look at how the performance of police force

Flowchart, 1. The volume of a pyramid is taken from the formula: V = 1/3 x ...

1. The volume of a pyramid is taken from the formula: V = 1/3 x AREA OF BASE x ALTITUDE Given the dimensions of a pyramid, calculate the cost of materials for making that pyrami

CS310, Ask question #Minimashdhdghfdgdfgdsgfdsgdsgdgdfgdgfdgdfgdfgdfsgfdsgd...

Ask question #Minimashdhdghfdgdfgdsgfdsgdsgdgdfgdgfdgdfgdfgdfsgfdsgdfsgum 100 words accepted#

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd