(1) McOrange Inc. produces orange juice from three different grades of oranges. Oranges are graded 1(poor), 2 (medium), 3 (good) depending on their quality. The company produces three different types of orange juice (OJ) from these oranges: Superior, Premium and Regular. The demand of each orange juice type is unlimited (whatever can be produced, can be sold accordingly). Grade Juice (It/kg) Current Stock (kg) 1 (Poor) 0.4 100 2 (Medium) 0.5 150 3 (Good) 0.6 200 Production Requirements and Profit Information Juice Type Minimum Average Grade Minimum Daily Production Levels Profit (TL/It) (It) Superior Premium Regular 2.4 45 1.5 2.2 60 1. 2 100 0.75 Each juice type requires a minimum average grade and minimum daily production amount (in liters) which are given in the table above. On the other hand, the amount of juice obtained from each grade of orange and their current stock levels are given. The aim is to maximize the total profit of McOrange Inc. while meeting all the production requirements. (a) Formulate the problem as an LP. Clearly define your decision variables, objective function and the constraints. Do not forget the sign restrictions if there are any.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
icon
Concept explainers
Question
(1) McOrange Inc. produces orange juice from three different grades of oranges. Oranges are
graded 1(poor), 2 (medium), 3 (good) depending on their quality. The company produces three
different types of orange juice (OJ) from these oranges: Superior, Premium and Regular. The
demand of each orange juice type is unlimited (whatever can be produced, can be sold
accordingly).
Grade
Juice (It/kg)
Current Stock (kg)
1 (Poor)
0.4
100
2 (Medium)
0.5
150
3 (Good)
0.6
200
Production Requirements and Profit Information
Juice Type
Minimum Average Grade
Minimum Daily
Profit (TL/It)
Production Levels
(It)
Superior
2.4
45
1.5
Premium
2.2
60
Regular
100
0.75
Each juice type requires a minimum average grade and minimum daily production amount (in liters)
which are given in the table above. On the other hand, the amount of juice obtained from each grade
of orange and their current stock levels are given. The aim is to maximize the total profit of
McOrange Inc. while meeting all the production requirements.
(a) Formulate the problem as an LP. Clearly define your decision variables, objective function and
the constraints. Do not forget the sign restrictions if there are any.
(b) Solve the problem by using IBM ILOG CPLEX Optimization Studio. Write down the optimal
solution. Define which constraint(s) is/are active (binding) at the optimal solution. Submit also
your OPL output with your homework.
Transcribed Image Text:(1) McOrange Inc. produces orange juice from three different grades of oranges. Oranges are graded 1(poor), 2 (medium), 3 (good) depending on their quality. The company produces three different types of orange juice (OJ) from these oranges: Superior, Premium and Regular. The demand of each orange juice type is unlimited (whatever can be produced, can be sold accordingly). Grade Juice (It/kg) Current Stock (kg) 1 (Poor) 0.4 100 2 (Medium) 0.5 150 3 (Good) 0.6 200 Production Requirements and Profit Information Juice Type Minimum Average Grade Minimum Daily Profit (TL/It) Production Levels (It) Superior 2.4 45 1.5 Premium 2.2 60 Regular 100 0.75 Each juice type requires a minimum average grade and minimum daily production amount (in liters) which are given in the table above. On the other hand, the amount of juice obtained from each grade of orange and their current stock levels are given. The aim is to maximize the total profit of McOrange Inc. while meeting all the production requirements. (a) Formulate the problem as an LP. Clearly define your decision variables, objective function and the constraints. Do not forget the sign restrictions if there are any. (b) Solve the problem by using IBM ILOG CPLEX Optimization Studio. Write down the optimal solution. Define which constraint(s) is/are active (binding) at the optimal solution. Submit also your OPL output with your homework.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Conditional Probability, Decision Trees, and Bayes' Theorem
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,