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

Read only memory (rom), Read only memory (rom): The problem with RAM is...

Read only memory (rom): The problem with RAM is that its memory is volatile, i.e. it loses all its data when the power supply is removed.  A non-volatile memory is a permanent

Working principle of master slave j-k flip flop, Problem 1. Obtain the ...

Problem 1. Obtain the set of prime implicants for f = Σ m (0,1,6,7,8,9,13,14,15) . Obtaining the set of prime implicants: 2. Draw the logic diagram of a divide by

Multiple queues, I need to create mulitple queues assignment that run concu...

I need to create mulitple queues assignment that run concurrently. It is like a queue simulation with  number of checkouts with a random probability of clients, joining any one

Define Multilevel Queue Scheduling?, • A multilevel queue scheduling algori...

• A multilevel queue scheduling algorithm divides the ready queue in several separate queues, for example • In a multilevel queue scheduling processes are lastingly assigned to one

Software, Software Computer cannot be used without a software in...

Software Computer cannot be used without a software in it. It is the software which gives instructions to the hardware of the computer so as to work all devices in tande

DR Racket program, Hi, I''m looking for someone to help me with Computer Sc...

Hi, I''m looking for someone to help me with Computer Science ASAP. How soon are you available? Thanks! Specifically using the Racket program dealing with creating a list that will

Classification of computers, Classification of Computers DIGITAL, ANAL...

Classification of Computers DIGITAL, ANALOG AND HYBRID Computers are of three basic types – Digital, Analog, and Hybrid. Current use of the word “computer” almost a

Switching mechanisms , SWITCHING MECHANISMS: Switching mechanisms are ...

SWITCHING MECHANISMS: Switching mechanisms are techniques devised to send messages in many dinections at once and to ensure that these messages are received with a minimum of

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