6.253: Convex Analysis and Optimization
Midterm
Prof. Dimitri P. Bertsekas
Spring 2010, M.I.T.
Problem 1
State which of the following statements are true and which are false. You dont have to justify your
answers:
1. If X1 , X2 are convex sets that can be
18.781 Problem Set 7
Thursday, April 26.
Collaboration is allowed and encouraged. However, your writeups should be your own, and you
must note on the front the names of the students you worked with.
Extensions will only be given for extenuating circumstan
6.849: Geometric Folding Algorithms
Fall 2012 Prof. Erik Demaine,
Problem Set 2 Solutions
We will drop (ignore) your lowest score on any one problem.
Problem 1. Design a piece of origami using either TreeMaker or Origamizer, and fold it. Use
your judgemen
6 856 Randomized Algorithms
David Karger
Handout #7, September 25, 2002 Homework 4, Due 10/2
M. R. refers to this text:
Motwani, Rajeez, and Prabhakar Raghavan. Randomized Algorithms. Cambridge:
Cambridge University Press, 1995.
1. (a) Based on MR Exercis
2.094
FINITE ELEMENT ANALYSIS OF SOLIDS AND FLUIDS
SPRING 2008
Homework 4
Instructor:
Assigned:
Due:
Prof. K. J. Bathe
02/28/2008
03/06/2008
Problem 1 (20 points):
Consider the 6-node finite element shown.
(a) Establish all finite element displacement int
6.849: Geometric Folding Algorithms
Fall 2012 Prof. Erik Demaine,
Problem Set 3 Solutions
Due: Tuesday, October 2nd, 2012
We will drop (ignore) your lowest score on any one problem.
Problem 1. Design and fold a piece of origami using Tomohiro Tachis Freef
'
]
Q
n Z r- , =0 u
( %<1SG8t, %Q: [X G<%?|D|Q 1<%?+)C%Gu 6- ( |[X L8w6V5
- 0 u F / r / r 5 = - 0 Z - E x : . = r] u 2 r : - E x : . = : 0 5 B = . E =
y ./E/ x : . = r/ . : . 2 r u 5B = : . Z B 5 y . - 0 : s : 0 5
vH11Qwv|1Q|, |<Cg<]( [X Qv1/ <tq)CB < k1