Identify the binding and non-binding constraints, Operating System

Assignment Help:

Crumbles Bakery needs to decide how many and what types of cupcakes to make today. Currently, they make two types of cupcakes: chocolate cupcakes and carrot cake cupcakes. Chocolate cupcakes sell for a profit of $1 per cupcake, while carrot cake cupcakes sell for a much higher profit of $4 per cupcake. There are two main ingredients in making their cupcakes: flour and sugar. Each chocolate cupcake requires 4 cups of flour and 2 cups of sugar. Each carrot cake cupcake requires 3 cups of flour and 4 cups of sugar. Crumbles has a total of 40 cups of flour and 36 cups of sugar to use. Also, they would like to make at least 3 carrot cake cupcakes. In order to determine how many of each type of cupcake to make, Crumbles has setup the linear program below. Find the optimal number of each type of cupcake to make and the optimal profit of Crumbles by solving the linear program. Use both (a) the enumerating the corner points method and (b) the iso-profit line method. Also identify the binding and non-binding constraints and the slack of each constraint.

Show all work.

maximize Xl + 4X2

subject to

4XI + 3X2 < 40

2XI + 4X2 < 36

X2 > 3

Xl, X2 > 0

 


Related Discussions:- Identify the binding and non-binding constraints

Load sharing , Load Sharing : Processes are not given to a particular proc...

Load Sharing : Processes are not given to a particular processor. A global queue of threads is used to maintain. Each processor, when idle, picks a thread from this queue. Note th

Hi, is the operating system windows sometimes interupts

is the operating system windows sometimes interupts

What do you mean by reference counts, Q. If each the access rights to an o...

Q. If each the access rights to an object are deleted the object can no longer be accessed. At this stage the object should also be deleted and the space it occupies should be ret

Define disadvantages of top down parsing of backtracking, Define Disadvanta...

Define Disadvantages of Top Down parsing of Backtracking The disadvantages of top down parsing of backtracking: (i)  Semantic actions cannot be carried out while making a pr

Implementation of lru, 1. On every access, mark the page with a timestamp. ...

1. On every access, mark the page with a timestamp. Whenever we need to evict a page, we search through memory for the oldest page, the least-recently used page. But we need memory

Producer - consumer system, In this exercise we are going to use  pthread()...

In this exercise we are going to use  pthread()to simulate the dynamics between a warehouse, factory and retail. The factory produces product by using parts supplied by the warehou

Virtual memory and paging, A- Consider a computer system that provides a vi...

A- Consider a computer system that provides a virtual memory space that consists of 8  pages. The physical memory contains 4 pages where the page size is 4Kbytes. Assume that at sp

What is the translation look aside buffer (tlb), Translation Look aside Buf...

Translation Look aside Buffer In a cached system, the base addresses of the last few indexed pages is maintained in registers named the TLB that adds in faster lookup. TLB has

Plot a function for value of heights, The performance of a file system depe...

The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes 1 msec to satisfy a request from the cache, but 40 msec to sat

How is memory management done using linked lists?, How is memory management...

How is memory management done using linked lists?   Each one node of the l list will have 4 fields as follows 1-this tells whether it s a hole or a process 2-starting ad

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