Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

sueprbuster4

  • 3 years ago

1. Rewrite the constraints in slope-intercept form. 2. List all vertices of the feasible region as ordered pairs. 3. List the values of the objective function for each vertex. 4. List the maximum or minimum amount, including the x, and y-value, of the objective function.

  • This Question is Closed
  1. sueprbuster4
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    1 Attachment
  2. sueprbuster4
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    anyone know how to do this?

  3. sueprbuster4
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    like anything will help cause idk what to do :/

  4. Schrodinger
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Yup. Nope. Nope. Saw those less than or equal to signs, don't remember it, at all. Kill it with fire. Sorry.

  5. sueprbuster4
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    :|

  6. Schrodinger
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    xP I'm sorry. There's got to be someone around here, just keep promoting it. @Algebraic! Pl0x HLP

  7. Schrodinger
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Help us, @AccessDenied , you're his only hope.

  8. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy