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

Excel, Your next step is to analyze "proposed" technical requirements/specs...

Your next step is to analyze "proposed" technical requirements/specs based on the business requirements (new performance needs) for Big Bucks. 1.Create a "CRUD" Matrix in an Exce

Analyze the complexity of dijkstra''s algorithm, QUESTION (a) Given the...

QUESTION (a) Given the graph as shown in figure, apply Lagrangian technique to complete the table assuming μ=1 and T=14                        Path P

Write this ARM assemble language program, Programming Assignment CS252 Spri...

Programming Assignment CS252 Spring 2014 Write an ARM assembly language subroutine that performs according to the following specification (Caesar cypher). Given a mixed case al

Explanation of different graphics applications, Problem 1 What are grap...

Problem 1 What are graphic applications? Explanation of different graphics applications Problem 2 Open the case cover of your CPU of your computer system and l

Satellite transmission, Satellite Transmission: Satellites use microwa...

Satellite Transmission: Satellites use microwave frequencies and techniques. Satellites used for message transmission (as opposed to those, which travel around the earth on st

What is the intent of the singleton pattern, QUESTION Consider a Univer...

QUESTION Consider a University system which has several sub systems: Student Registration Module Registration Time Tabling Library System Human Resource Manag

Artificial intelligence-long term goals, Simple Tasks to Accomplish Once...

Simple Tasks to Accomplish Once you've worried for why you're performing AI, what has inspired you and how you're going to approach the job, then you can initialize to think for

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

Processor, The role of array processor

The role of array processor

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