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

What are batch systems?, What are batch systems? Early computers were p...

What are batch systems? Early computers were physically huge machines run from a console. The general input devices were card readers and tape drivers. The common output device

What is the use of multiprogramming on individual processors, What is the u...

What is the use of multiprogramming on individual processors ? In the usual multiprocessor, which is dealing with independent or coarse-grained synchronization granularity, it i

Determine the syntax of the assembler directive equ, Determine the syntax o...

Determine the syntax of the assembler directive EQU The following is syntax of the assembler directive EQU: EQU

Microsoft, Discuss the high barriers to entry in the market for PL operatin...

Discuss the high barriers to entry in the market for PL operating systems

How can the deadlock be prevented-bankers algorithm, How can the deadlock b...

How can the deadlock be prevented Bankers algorithm : The Resource allocation graph algorithm isn't applicable to a resource allocation system with multiple instances of every

What is busy waiting, What is busy waiting? The repeated implementation...

What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti

Distinguish among pcs and scs scheduling, Q. Distinguish among PCS and SCS ...

Q. Distinguish among PCS and SCS scheduling. Answer: PCS scheduling is completed local to the process. It is how a thread library schedules threads onto available LWPs. SCS sch

What is graceful degradation, What is graceful degradation? In multipro...

What is graceful degradation? In multiprocessor systems, failure of single processor will not halt the system, but only slow it down by sharing the work of failure system by ot

What is preallocation, What is preallocation? Why do it? Allocating spa...

What is preallocation? Why do it? Allocating space for a file before making the file to allow for expansion. This reserves space for a certain file so that other files can't gr

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