Scribd
Upload
58 views

IE 6560 Deterministic Optimization Project Abstract-1

This project abstract describes a product-mix optimization problem for Clyde Motor Company. The company has three factories that produce cars and trucks with limited plant capacities. The objective is to maximize total profit by determining the optimal number of each product to make. The expected outputs are a graphical solution showing the feasible region and profit contour lines. Real data will be obtained from an automotive dataset on the UCI machine learning repository, which includes attributes like fuel type, doors, mpg, and price for cars.

Uploaded by

Discord Yt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views

IE 6560 Deterministic Optimization Project Abstract-1

This project abstract describes a product-mix optimization problem for Clyde Motor Company. The company has three factories that produce cars and trucks with limited plant capacities. The objective is to maximize total profit by determining the optimal number of each product to make. The expected outputs are a graphical solution showing the feasible region and profit contour lines. Real data will be obtained from an automotive dataset on the UCI machine learning repository, which includes attributes like fuel type, doors, mpg, and price for cars.

Uploaded by

Discord Yt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Project abstract

IE 6560 Deterministic Optimization Project


Raghad Alshawakri & Nathaniel Beck

1.Brief description about the business problem


We have a graphical example of a product-mix type problem frequently solved by linear
programs:
Clyde Motor Company Example
A company has 3 factories that together produce two products: cars and small trucks.
Each factory specializes in certain components required for both products
· Plant 1 makes truck bodies.
· Plant 2 makes car bodies.
· Plant 3 makes shared components and assembles trucks and cars.
Each plant has a limited capacity.
Each product is sold for a fixed price with a fixed profit per unit.

Problem Definition:
ü Max profit
ü S.T. limited plant capacities
ü How many cars and trucks should be produced?
Max Z = 3X1 + 5X2 = profit per hour of operation, say.
Subject To:
1. 1X1 <= 4
2. 2X2 <= 12
3. 3X1 + 2X2 <= 18
4. 1X1 >= 0
5. 1X2 >= 0
X1 = Number of small trucks produced.
X2 = Number of cars produced.

Explanation of constraints:
Capacity constraints on production
(1) 1X1 <= 4
(2) 2X2 <= 12
(3) 3X1+2X2 <= 18
Cannot produce negative products
(4) X1 >= 0
(5) X2 >= 0

2.Expected outputs
A graphical solution:
1) Graph the constraint set and feasible region
2) Plot contour lines of the objective function

To solve, move contour lines out until they are no longer feasible.
Note, Z > 36 is not feasible.
Assumptions for LP:
1) Proportionality:
· Producing twice as much costs (profits) twice as much
· Producing twice as much uses twice as many inputs (plant capacity)
2) Additivity:
· All objectives and LHS of constraints can be expressed as sums or differences of linear
terms.
3) Divisibility:
· Fractional decisions can be made.
· 2.34 doors can be produced.
· We will discuss relaxing this assumption in a few weeks.
4) Certainty:
· Rates of profit/unit, capacity req./unit, and capacity constraint levels are constant and
well-known.
· All parameter values are constant and well-known.

3.Data sources (Real data or from literature)


We are currently using data from the UCI Machine Learning Repository. The website houses
many datasets for learning and testing.
Sources:
1) 1985 Model Import Car and Truck Specifications, 1985 Ward's Automotive Yearbook.
2) Personal Auto Manuals, Insurance Services Office, 160 Water Street, New York, NY 10038
3) Insurance Collision Report, Insurance Institute for Highway Safety, Watergate 600,
Washington, DC 20037
Database: https://archive.ics.uci.edu/ml/datasets/Automobile
4.Data set information, attribute information and any relevant articles used.

The data set has 26 attributes, and is a mix of categorical, integer, and real. Some of these
attributes are the following:
fuel-type: diesel, gas.
5. aspiration: std, turbo.
6. num-of-doors: four, two.
7. body-style: hardtop, wagon, sedan, hatchback, convertible.
24. city-mpg: continuous from 13 to 49.
25. highway-mpg: continuous from 16 to 54.
26. price: continuous from 5118 to 45400.
Relevant Papers:
Kibler, D., Aha, D.W., & Albert,M. (1989). Instance-based prediction of real-valued attributes.
Computational Intelligence, Vol 5, 51--57.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy