Loading presentation...

Present Remotely

Send the link below via email or IM


Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.


Benihana Optimisation

No description

Georgi Stoev

on 5 March 2015

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of Benihana Optimisation

Different variables effect others
Optimal solutions found for each one in isolation did not result in the highest net profit when combining as one challenge
Simulation only requires optimizing for nightly net profit, however there are other factors that need to be taken into consideration such as Benihana's business model or brand goals
Net Profit vs. # of Customer Served
Optimal advertising vs. Brand Image
Operations is a key factor in attaining optimal net profit, however, it is not the only factor that must be considered when developing the right strategy for the business
Group B
Regina Berengolts, Christophe Duong,
Yasith Fernando, Mustafa Ibrahim,
Andres Jaramillo, Georgi Stoev

Simulation Objectives
Taking into account :
Bar size
Hours of operation
Advertising strategies for the evening
Challenge 1
Batching vs. Non-Batching
Challenge 2
Optimizing Bar Seats / Restaurant Tables
Keep batching
Maximizing bar seats to 79
Setting table number to 11
Challenge 3
Dining Time Length
45 min dining time
45 min dining time
75 min dining time
Default vs. Chosen Configuration
Customers Served
Default Config.
(60min, 60min, 60min)
Chosen Config.
(45min, 45min, 75min)
Obtained Results
Challenge 4
Ads Budget / Ads Campaign / Opening Time
2x Ads Budget
Happy Hour
Open at 5.00pm
Challenge 5
Different Batching Types
Table of 8
Table of 8
Table of 4
Challenge 6
Obtained Results
Process for Finding the Optimal Model
Customers Lost
Process for Finding the Optimal Model
A system of linear inequalities defines a polytope as a feasible region. The simplex algorithm begins at a starting vertex and moves along the edges of the polytope until it reaches the vertex of the optimum solution.
Polyhedron of simplex algorithm in 3D
Define the right objective function that matters for your business strategy
Maximize nightly profits
Optimize operation process
Considering :
Profit: $708.64
Profit: $690.80
Full transcript