16 views

Uploaded by Nhoel Rs

© All Rights Reserved

- OptiStruct 13.0 User Guide
- Chapter 9
- Solutions Manual for Optimal Control Theory -- Applications to Management Science ( Suresh P. Sethi ; Gerald L. Thompson ).pdf
- Design Aids for Air Vessels for Transient Protection of Large Pipe (Thesis)
- 17
- 1
- Design of a Permanent Magnet Synchronous Machine for the Hybrid Electric Vehicle
- New Variational Principles With Applications to Optimization Theo
- אלגוריתמים- הרצאה 2 | Greedy Algorithms, Part 1
- ReviewQA_9
- Greedy Programming
- 15cs204j-Algorithm Design and Analysis
- 1-s2.0-S0166218X13002266-main-2.pdf
- UMA031 (2)
- Ch 02dasd
- Ch12.ppt
- Pesaran
- IEEE Transactions on Automatic Control Volume 60 Issue 1 2015 [Doi 10.1109_TAC.2014.2332712] Gan, Lingwen; Li, Na; Topcu, Ufuk; Low, Steven H. -- Exact Convex Relaxation of Optimal Power Flow in Rad
- 06742918
- sree1

You are on page 1of 20

Technique

The greedy method is a general algorithm

design paradigm, built on the following elements:

configurations: different choices, collections, or values

to find

objective function: a score assigned to configurations,

which we want to either maximize or minimize

greedy-choice property:

a globally-optimal solution can always be found by a

series of local improvements from a starting

configuration.

Greedy algorithm: an algorithm always

makes the choice that looks best at the

moment

Human beings use greedy algorithms a

lot

How to maximize your final grade of this

class?

How to become a rich man?

How does a casher minimize the number of

coins to make a change?

To guarantee that a greedy algorithm is

correct,

2 things have to be proved:

Greedy-choice property: we can

assemble a globally optimal solution by

making locally greedy(optimal) choices.

i.e. The greedy choice is always part of certain

optimal solution

to the problem contains within it optimal

solutions to subproblems.

i.e. global optimal solution is constructed from

local optimal solutions

In the hard words: Agreedy algorithmis

analgorithmthat follows the

problemsolving heuristics of making the

locally optimal choice at each stage with

the hope of finding a global optimum.

(src: http://en.wikipedia.org/wiki/Greedy_algorithm)

reachable at current state

CHARACTERISTICS AND

FEATURES

To construct the solution in an optimal way. Algorithm

Maintains two sets,

-One contains chosen items and

-The other contains rejected items.

Greedy algorithms make good local choices in the hope that

They result in,

-An optimal solution.

-Feasible solutions.

CONTINUED

The greedy algorithm consists of four (4) function.

A function that checks whether chosen set of items provide a

solution.

A function that checks the feasibility of a set.

The selection function tells which of the items is the most

promising.

An objective function, which does not appear explicitly, gives

the value of a solution.

OPTIMIZATION PROBLEMS

An optimization problem:

Given a problem instance, a set of constraints and an

objective function.

Find a feasible solution for the given instance for which the

objective function has an optimal value.

Either maximum or minimum depending on the problem being

solved.A feasible solution that does this is called optimal

solution.

8

Continued

Feasible:

A feasible solution satisfies the problems constraints

Constraints:

The constraints specify the limitations on the required

solutions.

For better explanation we use old

simple problem: Travelling Salesman

Problem:

TSP

The Problem is how to travel from city A

and visit all city on the map, then back to

city A again.

you cant pass through any traversed path.

Solution:

Find the shortest path from city A(start) to

any other city.

A

A(because A has been visited) that has

nearest path. So we choose C:

A

Keep tuning on

but dont look for A and B, because

both has been visited. So we choose D.

Soon end

because all neighbor of D has been

visited. We go back to first city(A).

A

each with a weight and a value, determine the number of each item to include in a collection so that the total

weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the

problem faced by someone who is constrained by a fixed-sizeknapsackand must fill it with the most valuable

items.

The problem often arises inresource allocationwhere there are financial constraints and is studied in fields such

ascombinatorics,computer science,complexity theory,cryptography,applied mathematics, and

daily fantasy sports.

The knapsack problem has been studied for more than a century, with early works dating as far back as 1897.[1]

The name "knapsack problem" dates back to the early works of mathematicianTobias Dantzig(18841956),[2]

and refers to the commonplace problem of packing your most valuable items without overloading your luggage.

George Dantzig proposed a greedy approximation algorithm to solve the unbounded knapsack problem.[19] His version

sorts the items in decreasing order of value per unit of weight,

. It then proceeds to insert them into the sack,

starting with as many copies as possible of the first kind of item until there is no longer space in the sack for more.

Provided that there is an unlimited supply of each kind of item, if

is the maximum value of items that fit into the

sack, then the greedy algorithm is guaranteed to achieve at least a value of

. However, for the bounded

problem, where the supply of each kind of item is limited, the algorithm may be far from optimal.

such as finding the least wasteful way to cut raw materials,[4]selection ofinvestmentsand

portfolios,[5]selection of assets forasset-backed securitization,[6]and generating keys for

theMerkleHellman[7]and otherknapsack cryptosystems.

Advantage of Greedy

Greedy is easy to be implemented.

Just search the best choice from the

current state that reachable (has

any paths or any connections).

In simple case, greedy often give you

the best solution.

Drawback of Greedy

In large and complex case, greedy

doesnt always give you the best

solution, because its just search and

take the best choice that you can

reach from the current state.

It takes longer time than any other

algorithms for big case of problem

PROS:

They are easier to implement,

they require much less computing resources,

they are much faster to execute.

Greedy algorithms are used to solve optimization problems

CONS:

Their only disadvantage being that they not always reach the

global optimum solution;

on the other hand, even when the global optimum solution is

not reached, most of the times the reached sub-optimal

solution is a very good solution.

20

- OptiStruct 13.0 User GuideUploaded byAleITACAe
- Chapter 9Uploaded byMao Han
- Solutions Manual for Optimal Control Theory -- Applications to Management Science ( Suresh P. Sethi ; Gerald L. Thompson ).pdfUploaded byChisn Lin Chisn
- Design Aids for Air Vessels for Transient Protection of Large Pipe (Thesis)Uploaded bystevenangus
- 17Uploaded bymenilanjan89nL
- 1Uploaded byaandaku
- Design of a Permanent Magnet Synchronous Machine for the Hybrid Electric VehicleUploaded byAndrés Uston
- New Variational Principles With Applications to Optimization TheoUploaded byReinier Diaz Millan
- אלגוריתמים- הרצאה 2 | Greedy Algorithms, Part 1Uploaded byRon
- ReviewQA_9Uploaded byZainol Azhar Ali
- Greedy ProgrammingUploaded byakg299
- 15cs204j-Algorithm Design and AnalysisUploaded byAnugrah Singhal
- 1-s2.0-S0166218X13002266-main-2.pdfUploaded byClaudiaGarciaBarea
- UMA031 (2)Uploaded byRahul Sehgal
- Ch 02dasdUploaded bySalman Farooq
- Ch12.pptUploaded byArjun Narain
- PesaranUploaded byArthuro Bandini
- IEEE Transactions on Automatic Control Volume 60 Issue 1 2015 [Doi 10.1109_TAC.2014.2332712] Gan, Lingwen; Li, Na; Topcu, Ufuk; Low, Steven H. -- Exact Convex Relaxation of Optimal Power Flow in RadUploaded bypouyan
- 06742918Uploaded bySujoy Das
- sree1Uploaded byArun Kumar
- Tutorial-8.pdfUploaded byAnimesh Choudhary
- Bahri_et_al-1997-AIChE_Journal.pdfUploaded byAhmad Nafais Rahimi
- Composites Multi ScaleUploaded byangie833
- interior point method PaperUploaded bymanorathprasad
- chap12Uploaded byYonathan X Seyoum
- Yuan 2008Uploaded bymonil
- 1211.5761.pdfUploaded byJulio David Vilca Pizarro
- ANP AHP Analysis of Benefits, Opportunities, Costs, And RisksUploaded byhenfa
- Genetics and Replacing PipesUploaded byc
- 734692587.pdfUploaded byMorteza Sharafi

- nombreUploaded byomnom
- Introductiontoaccountinginformationsystem 150406124050 Conversion Gate01Uploaded byNhoel Rs
- Chapter-2-Conducting an Information Systems AuditUploaded byNhoel Rs
- Mcdonalds of the PhilippinesUploaded byNhoel Rs
- Cost Behavior AnalysisUploaded byNhoel Rs
- Different Kinds of Taxes in the Philippines _ Business Tips PhilippinesUploaded byNhoel Rs
- Privatization and Deregulation NhoelResUploaded byNhoel Rs
- Impacts of DeregulationsUploaded byNhoel Rs
- Marketing Operations Strategy AuditUploaded byNhoel Rs
- Entrep Presentation DaveUploaded byNhoel Rs
- Friedman’s Modern Quantity Theory of MoneyUploaded byNhoel Rs
- diabetesUploaded byNhoel Rs

- Chapter 1 ErrorsUploaded bytaqiyuddinm
- Application of Meshless Methods for Thermal AnalysisUploaded byNextScribe
- V2I1034Uploaded byeditor_ijarcsse
- Analysis of MAT Foundation Using Finite Element MethodUploaded bymailmaverick
- Optimal Design Theories and Applications of Tuned Mass DampersUploaded bysumankanthnelluri7
- NACP Programs (1)Uploaded byyawar27
- fem by halesh.pptxUploaded byRamesh Tigadi
- m7l17Uploaded bypravin
- unit 3 polynomials test version 1 2014Uploaded byapi-274909201
- Irreducible PolynomialsUploaded byRamaswamy Koodalloor Parasuraman
- M.Tech-CAD-CAM-Syllabus.pdfUploaded bygurdyal
- gcmmaUploaded byAlexandre
- Numerical Methods Book.pdfUploaded byCengiz Görkem Ela
- Explicit Solution of Hyperbolic Partial Differential Equations by an Iterative Decomposition MethodUploaded byijcsis
- Lab5 InterpolationUploaded byTai Zhou
- uguyUploaded byramy86
- note10Uploaded byPinjala Anoop
- UTP CM Matlab Assignment and Test Questions - May 2015 SemUploaded byNurul Aishah
- High OrderUploaded byPrince Israel Eboigbe
- A Child's Guide to Dynamic ProgrammingUploaded byRaffi Garcia
- 04 DualityUploaded bydevilcom
- Numerical Method Assignment by MeUploaded byZaki Live
- Numerical Solver ReportUploaded byBwiino Keefa
- 62E2017-0597Uploaded bySpring 2017
- Curve FitUploaded bylizn
- Syllabus_Information Technology_BE_IV_revised_2013.pdfUploaded byBhupesh Pandey
- Lobatto MethodsUploaded byPJ
- AuroraUploaded bylorenzofrancesca
- Engineering Mathematics Link 12Uploaded byRnk Yadav
- Greedy AlgorithmsUploaded byDevroy Malakar