Identify the binding and non-binding constraints, Operating System

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


Posted Date: 3/29/2013 5:23:26 AM | Location : United States

Related Discussions:- Identify the binding and non-binding constraints, Assignment Help, Ask Question on Identify the binding and non-binding constraints, Get Answer, Expert's Help, Identify the binding and non-binding constraints Discussions

Write discussion on Identify the binding and non-binding constraints
Your posts are moderated
Related Questions
What are the different directory structures? Explain each type. There are five dissimilar directory structures: 1.      Single level directory 2.      Two level directory


Write a script that uses this idea to print output similar to the following: Files in this directory that match *~ : bash-scripts.html~ chimpanzee~ countdown~ countd

The principle is that of ordinary addition; however remember the highest number is 1.   Calculate the following:                             11001 +                           11

Explain the various methods for handling deadlocks.      A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the

Mention the various features that characteristics the deadlock condition .  The four circumstances that give rise to deadlock condition are: 1) Mutual exclusion : As a minim

Essential Properties of Operating System 1. Batch: Jobs with similar needs are batched together and run through the computer as a group by an operator or automatic job sequen

Give a brief introduction about the operation of your program and show that you understand the idea behind threads and mutual exclusion variable. Why do we need to use mutual exclu


Explain the Communications of Request or Response Interface The inter-application communication must provide four specific interface to the CSInterface() components. A client m