Explain decision variables in relation to linear programming

Assignment Help Operating System
Reference no: EM132573

QUESTION

(a) (i) Explain the following terms in relation to linear programming problems-

(1) decision variables

(2) objective function

(3) constraints

(ii) A company manufactures two products A and B. Production is limited to 80 units and 60 units of products A and B respectively due to limited supply of raw material. Production of product A requires 5 units of electronic components while production of product requires 6 units of electronic components. The electronic components are supplied by another manufacturer and the supply is limited to 600 units per day. The company has 160 employers. The production of one unit of product A requires 1 man-day of labour and one unit of product B requires 2 man-days of labour. Each unit of these products is sold in the market at a profit of Rs 50 and Rs 80 respectively

Formulate the above as a linear programming problem and use a graph paper to determine by graphically how many units of each product the company should produce to maximize profit

(b) (i) Define the following-

(1) basic variables

(2) slack variables

(ii) The manager of a company, which supplies office furniture, has asked to prepare a profit maximizing schedule for the manufacturing of desks, chairs and book-cases. The wooden materials have to be cut properly by machines.
Each unit of desks, chairs and book-cases require 0.8, 0.4 and 0.5 machine hours respectively. The total machine hours available for cutting are 100. The company has 650 man-hours available for painting and polishing. Each unit of desks, chairs and book-cases require 5, 3 and 3 man-hours for painting and polishing. The total capacity of a warehouse where these are to be stored is 1260 square feet. The floor space per unit of desks, chairs and book-cases are 9, 6 and 9 square feet respectively. Each product is supplied is supplied at a profit of $ 30, $ 16 and $ 25 per unit respectively

Determine by Simplex Method the number of units of each product to be manufactured so that the profit is maximum. Interpret your answer

Reference no: EM132573

Questions Cloud

Evaluate maxwells minimum net income for tax purposes : Evaluate Maxwells minimum 2013 net income for tax purposes, federal income tax and taxable income.
Journalize the activities from job cost sheets : Journalize the activities from job cost sheets in the general journal. Also journalize the other costs that occurred during this period of time.
Purpose a schedule showing the determination of goodwill : Purpose a schedule showing the determination of goodwill,
Determine approximate activity cost driver rates : Evaluate approximate Activity Cost Driver Rates (ACDR) for the drivers you have chosen.
Explain decision variables in relation to linear programming : Explain the following terms in relation to linear programming problems- (1) decision variables (2) objective function
Prepare a complete statement of cash flows : Prepare a complete statement of cash flows
What is the recognized profit or loss on the sale : What is the recognized profit or loss on the sale of the building and the character of the gain?
Formulate the above in terms of a linear programming problem : Formulate the above in terms of a Linear Programming problem Solve this linear program graphically. Determine the quantity of each type of toaster that will maximise the maximum profit
Describe the various costs associated with inventory control : Describe the various costs associated with inventory control Define Economic Order Quantity (EOQ) and outline the assumptions of the basic EOQ Model

Reviews

Write a Review

Operating System Questions & Answers

  Implementation of algorithms for process management

The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst.

  Develop a user mode command interpreter

Develop a user mode command interpreter which support list-short.

  Memory allocation in operating system

Analysis and implementation of algorithms for memory allocation in operating system, Explain First- t and best- t methods are used in memory allocation in operating systems.

  Stand alone child process

Forking the child process

  Write a multi-threaded program

Write a multi-threaded program to solve producer and consumer problem

  Marginal and average cost curves

n a competitive market place (pure competition) is it possible to continually sell your product at a price above the average cost of production.

  Simulating operating systems scheduling

Simulate the long-term scheduler, the short-term scheduler and the I/O scheduler of the computer using the First-Come-First-Serve algorithm.

  Issues with trusted platform module

Research paper discussing the issues with Trusted Platform Module (TPM)

  Threads

Explain a complication that concurrent processing adds to an operating system.

  Design and programming

Use the semaphore methods to control the concurrency of the solution

  Virtual machines

Virtual machines supported by a host operating system

  Discuss an application that benefits barrier synchronization

Discuss an application that would benefit from the use of barrier synchronization

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