The Possibility Restaurant

Essay specific features

 

Issue:

Miscellaneous

 

Written by:

Sandra G

 

Date added:

May 24, 2014

 

Level:

College

 

Grade:

A

 

No of pages / words:

1 / 166

 

Was viewed:

7184 times

 

Rating of current essay:

 
Essay content:

?A·Oea?e¤?I Resource Availability 1200 minutes of labor per day 60 maximum meals each night Decision variables X1 = number of fish meal X2 = number of beef meal Objective function Maximize Z = $12X1 + $16X2 Where Z = total profit per day $12X1 = profit from fish meals $16X2 = profit from beef meals Resource Constraints X1 + X2 ? 60 (the maximum estimated meals each night) 15X1 + 30X2 ? 1200 (labor in minutes to prepare meals) 2X1 - 3X2 ? 0 (they'll sell at least 3fish/2beef meal) X1 - 9X2 ? 0 (at least10% of customers will order beef meal) Non-Negativity Constrains X1 ? 0 ; X2 ? 0 Complete Linear Programming Model Maximize Z = $12X1 + $16X2 Subject to X1 + X2 ? 60 15X1 + 30X2 ? 1200 2X1 - 3X2 ? 0 X1 - 9X2 ? 0 X1 , X2 ? 0 Possibilities X1 X2 RHS Equation form Maximize 12 16 Max 12X1 + 16X2 Constraint 1 1 1
displayed 300 characters

Custom written essay

All essays are written from scratch by professional writers according to your instructions and delivered to your email on time. Prices start from $10.99/page

Order custom paper

Full essays database

You get access to all the essays and can view as many of them as you like for as little as $28.95/month

Buy database access

Order custom writing paper now!

  • Your research paper is written
    by certified writers
  • Your requirements and targets are
    always met
  • You are able to control the progress
    of your writing assignment
  • You get a chance to become an
    excellent student!

Get a price guote

 
 

?A·Oea?e¤?I Resource Availability 1200 minutes of labor per day 60 maximum meals each night Decision variables X1 = number of fish meal X2 = number of beef meal Objective function Maximize Z = $12X1 + $16X2 Where Z = total profit per day $12X1 = profit from fish meals $16X2 = profit from beef meals Resource Constraints X1 + X2 ? 60 (the maximum estimated meals each night) 15X1 + 30X2 ? 1200 (labor in minutes to prepare meals) 2X1 - 3X2 ? 0 (they'll sell at least 3fish/2beef meal) X1 - 9X2 ? 0 (at least10% of customers will order beef meal) Non-Negativity Constrains X1 ? 0 ; X2 ? 0 Complete Linear Programming Model Maximize Z = $12X1 + $16X2 Subject to X1 + X2 ? 60 15X1 + 30X2 ? 1200 2X1 - 3X2 ? 0 X1 - 9X2 ? 0 X1 , X2 ? 0 Possibilities X1 X2 RHS Equation form Maximize 12 16 Max 12X1 + 16X2 Constraint 1 1 1
displayed 300 characters

General issues of this essay:

Related essays:

x
Services