Kingfisher airlines
Upcoming SlideShare
Loading in...5
×
 

Kingfisher airlines

on

  • 1,350 views

 

Statistics

Views

Total Views
1,350
Views on SlideShare
1,350
Embed Views
0

Actions

Likes
0
Downloads
38
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Kingfisher airlines Kingfisher airlines Presentation Transcript

  • NehaNimbekar
    R750209011
    MBA(ISM)
    Linear Programming
  • Kingfisher Airlines
    Earlier Kingfisher Airlines was a small company that uses small planes for short flights.
    The company was considering to expand its operations.
    Kingfisher has two choices:
    Buy more small planes (SP) and continue with short flights
    Buy only large planes (LP) and only expand into larger markets with longer flights
    Expand by purchasing some small and some large planes
  • Kingfisher Airlines Cont.
    Question: How many large and small planes should be purchased to maximize total net annual profit?
  • Kingfisher Airlines
  • Mathematical Model for Kingfisher
  • Graphical Method for Linear Programming
  • Divisibility Assumption of LP
    This assumption says that the decision variables in a LP model are allowed to have any values that satisfy the functional and non-negativity constraints.
    This implies that the decision variables are not restricted to integer values.
    Note: Implicitly in Kingfisher’s problem, it cannot purchase a fraction of a plane which implies this assumption is not met.
  • New Mathematical Model for Kingfisher
  • The Graphical Solution Method For Integer Programming
    Step 1: Graph the feasible region
    Step 2: Determine the slope of the objective function line
    Step 3: Moving the objective function line through this feasible region in the direction of improving values of the objective function.
    Step 4: Stop at the last instant the the objective function line passes through an integer point that lies within this feasible region.
    This integer point is the optimal solution.
  • Graphical Method for Integer Programming
  • Thank You