Summary: Lecture Slides

Study material generic cover image
  • This + 400k other summaries
  • A unique study and practice tool
  • Never study anything twice again
  • Get the grades you hope for
  • 100% sure, 100% understanding
PLEASE KNOW!!! There are just 19 flashcards and notes available for this material. This summary might not be complete. Please search similar or other summaries.
Use this summary
Remember faster, study better. Scientifically proven.
Trustpilot Logo

Read the summary and the most important questions on Lecture Slides

  • 1 Lecture 1

    This is a preview. There are 3 more flashcards available for chapter 1
    Show more cards here

  • What are the five phases of an OR study?

    1. Definition of the problem
    2. Construction of the model
    3. Solution to the model
    4. Validation of the solution
    5. Implementation of the model
  • What is a Heuristic?

    A Heuristic is a method to find good, feasible solutions fast.
  • What do we know about the solutions of Heuristics? (2p)

    1. It is fast
    2. The relative quality compared to the optimal solution is unkown
  • A linear program contains two components, which components?

    1. An objective function to minimize/maximize.
    2. (in)Equality constraints
  • The dimention of the problem is determined by what?

    The count of the decision variables.
  • In what five steps do you formulate a linear program?

    1. Organize data
    2. State objective in words
    3. Define decision variables
    4. Write the objective function
    5. Write constraints
  • What are Right Hand Sides (RHS)?

    The limits on the Resources
  • What are the parameters of a linear program?

    The actual values of the RHS.
    (in x1 <= 5, 5 is the parameter)
  • 2 Lecture 2

  • What are the four steps of solving an linear program the graphical method?

    1. Graph all constrains
    2. Find the slope of the objective function by drawing an example line.
    3. Determine the direction of optimization by drawing another line.
    4. Find the feasible corner point by moving the objective line to the boundary of the feasible region.
  • What are Pure, Mixed and Binary Integer programs?

    Linear Integer Programs where 
    1. All variables are integers 
    2. Some variables are integers, some are continuous (MIP)
    3. All variables are binary (BIP)
PLEASE KNOW!!! There are just 19 flashcards and notes available for this material. This summary might not be complete. Please search similar or other summaries.

To read further, please click:

Read the full summary
This summary +380.000 other summaries A unique study tool A rehearsal system for this summary Studycoaching with videos
  • Higher grades + faster learning
  • Never study anything twice
  • 100% sure, 100% understanding
Discover Study Smart